English

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

Combinatorics 2022-01-21 v1

Abstract

The gg-girth-thickness θ(g,G)\theta(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))\theta(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).

Keywords

Cite

@article{arxiv.1804.08723,
  title  = {On the 4-girth-thickness of the line graph of the complete graph},
  author = {Christian Rubio-Montiel},
  journal= {arXiv preprint arXiv:1804.08723},
  year   = {2022}
}

Comments

7 pages