The 6-girth-thickness of the complete graph

The 6-girth-thickness of the complete graph

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

Bibliographic Details
Main Authors: Héctor Castañeda-López, Pablo C. Palomino, Andrea B. Ramos-Tort, Christian Rubio-Montiel, Claudia Silva-Ruiz
Format: Article
Language:English
Published: Taylor & Francis Group 2020-09-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
thickness
planar decomposition
complete graph
girth
Online Access:http://dx.doi.org/10.1016/j.akcej.2019.05.004

Internet

http://dx.doi.org/10.1016/j.akcej.2019.05.004

Similar Items