Planar graphs having no proper 2-immersions in the plane. I

DOI10.1016/j.disc.2021.112482zbMath1467.05048OpenAlexW3167480720MaRDI QIDQ2037555

Vladimir P. Korzhik

Publication date: 8 July 2021

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

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

zbMATH Keywords

topological graphcrossing edges2-planar graph2-immersion

Mathematics Subject Classification ID

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

Related Items

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. III

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proper 1-immersions of graphs triangulating the plane
• On drawings and decompositions of 1-planar graphs
• 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
• Planar graphs having no proper 2-immersions in the plane. II
• Planar graphs having no proper 2-immersions in the plane. III
• Ein Sechsfarbenproblem auf der Kugel
• An annotated bibliography on 1-planarity
• Algorithms for graphs embeddable with few crossings per edge
• Minimal non-1-planar graphs
• Approximation Algorithms for Independent Sets in Map Graphs
• On properties of maximal 1-planar 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
• Computing and Combinatorics
• A new proof of the 6 color theorem
• Structure of Graphs with Locally Restricted Crossings