Abstract
The g-girth-thickness of a graph G is the minimum number of planar subgraphs of girth at least g whose union is G. In this paper, we determine the 6-girth-thickness of the complete graph Kn in almost all cases. And also, we calculate by computer the missing value of
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have