Proper 1-immersions of graphs triangulating the plane

DOI10.1016/j.disc.2013.07.019zbMath1280.05030OpenAlexW2002951193MaRDI QIDQ394202

Vladimir P. Korzhik

Publication date: 24 January 2014

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

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

zbMATH Keywords

topological graph1-planar graph1-immersioncrossing edges

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (4)

All 2-planar graphs having the same spanning subgraph ⋮ Planar graphs having no proper 2-immersions in the plane. II ⋮ Planar graphs having no proper 2-immersions in the plane. I ⋮ Planar graphs having no proper 2-immersions in the plane. III

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear-time algorithm for 7-coloring 1-plane graphs
• The structure of 1-planar graphs
• Bemerkungen zu einem Sechsfarbenproblem von G. Ringel
• Graphs drawn with few crossings per edge
• Right angle crossing graphs and 1-planarity
• Ein Sechsfarbenproblem auf der Kugel
• Minimal non-1-planar graphs
• Approximation Algorithms for Independent Sets in Map Graphs
• Re-embeddings of Maximum 1-Planar Graphs
• Map graphs
• Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
• Zur Struktur 1‐planarer Graphen
• Rectilinear drawings of graphs
• Computing and Combinatorics
• A new proof of the 6 color theorem
• On the Density of Maximal 1-Planar Graphs
• Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time

This page was built for publication: Proper 1-immersions of graphs triangulating the plane