The 6-girth-thickness of the complete graph

DOI10.1016/j.akcej.2019.05.004zbMath1468.05048arXiv1709.07466OpenAlexW2759655742MaRDI QIDQ4956180

A. B. Ramos-Tort, Héctor Castañeda-López, Claudia Silva-Ruiz, Christian Rubio-Montiel, Pablo C. Palomino

Publication date: 1 September 2021

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

thicknessgirthcomplete graphplanar decomposition

Mathematics Subject Classification ID

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

Uses Software

• House of Graphs

Cites Work

• Unnamed Item
• 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
• The thickness of the complete multipartite graphs and the join of graphs
• Determining the thickness of graphs is NP-hard
• The 4-girth-thickness of the complete graph
• The 4-girth-thickness of the complete multipartite graph
• Remarks on the thickness of K_n,n,n
• The Thickness of the Complete Graph
• Die dicke des n-dimensionalen Würfel-graphen
• Minimal Decompositions of Complete Graphs into Subgraphs with Embeddability Properties
• On the thickness of the complete graph

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