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: | Rubio-Montiel, Christian; National Autonomous University of Mexico (Author) |
---|---|
Other Authors: | partially supported by PAIDI/007/19 (Contributor) |
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!
|
Similar Items
-
On imbalances in multipartite multidigraphs
by: Samee, Uma Tul; Department of Mathematics, Islamia College for Science and Commerce, Srinagar, Kashmir, India, et al.
Published: (2018) -
Cofinite graphs and their profinite completions
by: Acharyya, Amrita; Department of Mathematics and Statistics, University of Toledo, et al.
Published: (2017) -
C_4 decomposition of the tensor product of complete graphs
by: Oyewumi, Opeyemi; General Studies Department, Air Force Institute of Technology, Kaduna, Nigeria, et al.
Published: (2020) -
Decomposition of complete graphs into connected bipartite unicyclic graphs with eight edges
by: Fahnenstiel, John; Department of Mathematics and Statistics, University of Minnesota Duluth, Duluth, MN 55812, U.S.A, et al.
Published: (2019) -
Complete bipartite graph is a totally irregular total graph
by: Tilukay, Meilin I.; Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Pattimura, Jalan Ir. M. Putuhena, Kampus Unpatti Poka Ambon, Indonesia, et al.
Published: (2021)