On the 4-girth-thickness of the line graph of the complete graph

preprint2018arXivOpen access

Abstract

The gg-girth-thickness θ(g,G)θ(g,G) of a graph GG is the minimum number of planar subgraphs of girth at least gg whose union is GG. In this note, we give the 44-girth-thickness θ(4,L(Kn))θ(4,L(K_n)) of the line graph of the complete graph L(Kn)L(K_n) when nn is even. We also give the minimum number of subgraphs of L(Kn)L(K_n), which are of girth at least 44 and embeddable on the projective plane, whose union is L(Kn)L(K_n).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.