Zur Struktur 1‐planarer Graphen

DOI10.1002/mana.19861250122zbMath0594.05026OpenAlexW2801305409MaRDI QIDQ3724362

H. Schumacher

Publication date: 1986

Published in: Mathematische Nachrichten (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/mana.19861250122

zbMATH Keywords

cycleembeddabilityforest1-planar graphsminimal vertex degreenon-minimal graphs

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (max. 100)

Edge-pancyclicity of coupled graphs ⋮ Contact Representations of Graphs in 3D ⋮ Recognizing IC-Planar and NIC-Planar Graphs ⋮ \(K_7\)-minors in optimal 1-planar graphs ⋮ \(\mathsf{NIC}\)-planar graphs ⋮ Proper 1-immersions of graphs triangulating the plane ⋮ A note on 1-planar graphs ⋮ Matchings in 1‐planar graphs with large minimum degree ⋮ All 2-planar graphs having the same spanning subgraph ⋮ Optimal 1-planar multigraphs ⋮ Recognizing optimal 1-planar graphs in linear time ⋮ \(\mathsf{T}\)-shape visibility representations of 1-planar graphs ⋮ Unnamed Item ⋮ Characterizing and recognizing 4-map graphs ⋮ Minimal non-1-planar graphs ⋮ Characterizing 5-map graphs by 2-fan-crossing graphs ⋮ Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing ⋮ Remarks on the joins of 1-planar graphs ⋮ Planar graphs having no proper 2-immersions in the plane. I ⋮ The maximal 1-planarity and crossing numbers of graphs ⋮ Optimal 1-planar graphs which triangulate other surfaces ⋮ 1-Planar Graphs ⋮ Counting cliques in 1-planar graphs ⋮ All subgraphs of a wheel are 5-coupled-choosable

This page was built for publication: Zur Struktur 1‐planarer Graphen