The 4-girth-thickness of the complete multipartite graph

DOI10.5614/ejgta.2019.7.1.14zbMath1467.05052arXiv1709.03932OpenAlexW2755670417MaRDI QIDQ5009944

Christian Rubio-Montiel

Publication date: 23 August 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.03932

zbMATH Keywords

thicknessgirthcomplete multipartite graphplanar decomposition

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (2)

The 6-girth-thickness of the complete graph ⋮ A note on the 4-girth-thickness of K_n,n,n

Uses Software

• House of Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multilayer grid embeddings for VLSI
• The thickness of graphs: A survey
• Complete colorings of planar graphs
• House of Graphs: a database of interesting graphs
• Variations on Ringel's earth-moon problem
• Determining the thickness of graphs is NP-hard
• Thickness of graphs with degree constrained vertices
• The 4-girth-thickness of the complete graph
• Remarks on the thickness of K_n,n,n
• The Thickness of the Complete Graph
• Die dicke des n-dimensionalen Würfel-graphen
• On the Planar Decomposition of a Complete Bipartite Graph
• Minimal Decompositions of Complete Graphs into Subgraphs with Embeddability Properties
• Decomposition of Finite Graphs Into Forests
• On the thickness of the complete graph

This page was built for publication: The 4-girth-thickness of the complete multipartite graph