On the 4-girth-thickness of the line graph of the complete graph
Combinatorics
2022-01-21 v1
Abstract
The -girth-thickness of a graph is the minimum number of planar subgraphs of girth at least whose union is . In this note, we give the -girth-thickness of the line graph of the complete graph when is even. We also give the minimum number of subgraphs of , which are of girth at least and embeddable on the projective plane, whose union is .
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