The 4-girth-thickness of the complete multipartite graph
| Main Author: | Rubio-Montiel, Christian; National Autonomous University of Mexico |
|---|---|
| Other Authors: | partially supported by PAIDI/007/19 |
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
, 2019
|
| Subjects: | |
| Online Access: |
https://www.ejgta.org/index.php/ejgta/article/view/631 https://www.ejgta.org/index.php/ejgta/article/view/631/pdf_104 |
Daftar Isi:
- 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.