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 .
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.