\(K_7\)-minors in optimal 1-planar graphs

DOI10.1016/j.disc.2017.01.022zbMath1369.05188OpenAlexW2602314645MaRDI QIDQ2400554

Yusuke Suzuki

Publication date: 29 August 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2017.01.022

zbMATH Keywords

1-planar graphtopological minor\(K_7\)-minor

Mathematics Subject Classification ID

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

Related Items (4)

On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs ⋮ Optimal 1-planar multigraphs ⋮ Unnamed Item ⋮ 1-Planar Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
• \(K_{6}\)-minors in triangulations on the nonorientable surface of genus 3
• A linear-time algorithm for 7-coloring 1-plane graphs
• The structure of 1-planar graphs
• Bemerkungen zu einem Sechsfarbenproblem von G. Ringel
• \(K_6\)-minors in projective planar graphs
• Ein Sechsfarbenproblem auf der Kugel
• Minimal non-1-planar graphs
• Homomorphiesätze für Graphen
• Generation of simple quadrangulations of the sphere
• Approximation Algorithms for Independent Sets in Map Graphs
• On properties of maximal 1-planar graphs
• Re-embeddings of Maximum 1-Planar Graphs
• Über 1-optimale Graphen
• The Minor Crossing Number
• Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
• K₆-minors in triangulations and complete quadrangulations
• Zur Struktur 1‐planarer Graphen
• $K_6$-Minors in Triangulations on the Klein Bottle
• The crossing number of K₁₁ is 100
• Crossing Number Problems

This page was built for publication: \(K_7\)-minors in optimal 1-planar graphs