The 4-girth-thickness of the complete multipartite graph
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.
Saved in:
Main Author: | |
---|---|
Other Authors: | |
Format: | EJournal Article |
Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2019-04-05.
|
Subjects: | |
Online Access: | Get Fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | 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. |
---|---|
Item Description: | https://www.ejgta.org/index.php/ejgta/article/view/631 |