2 research outputs found
A note on the 4-girth-thickness of K_{n,n,n}
The -girth-thickness of a graph is the minimum number of
planar subgraphs of girth at least four whose union is . In this paper, we
obtain that the 4-girth-thickness of complete tripartite graph is
except for . And we
also show that the -girth-thickness of the complete graph is three
which disprove the conjecture posed by Rubio-Montiel (Ars
Math Contemp 14(2) (2018) 319)
On the 4-girth-thickness of the line graph of the complete graph
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 .Comment: 7 page