The 4-girth-thickness of the complete multipartite graph

Christian Rubio-Montiel

Abstract


The g-girth-thickness θ(g, G) of a graph G is the smallest number of planar subgraphs of girth at least g whose union is G. In this paper, we calculate the 4-girth-thickness θ(4, G) of the complete m-partite graph G when each part has an even number of vertices.


Keywords


thickness, planar decomposition, complete multipartite graph, girth

Full Text:

PDF

DOI: http://dx.doi.org/10.5614/ejgta.2019.7.1.14

Refbacks

  • There are currently no refbacks.


ISSN: 2338-2287

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View EJGTA Stats