AKCE International Journal of Graphs and Combinatorics (Sep 2020)

The 6-girth-thickness of the complete graph

  • Héctor Castañeda-López,
  • Pablo C. Palomino,
  • Andrea B. Ramos-Tort,
  • Christian Rubio-Montiel,
  • Claudia Silva-Ruiz

DOI
https://doi.org/10.1016/j.akcej.2019.05.004
Journal volume & issue
Vol. 17, no. 3
pp. 856 – 861

Abstract

Read online

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

Keywords