Über 1-optimale Graphen

From MaRDI portal
Publication:3222859

DOI10.1002/mana.3211170125zbMath0558.05017OpenAlexW1993576898MaRDI QIDQ3222859

H. Schumacher, Klaus Wagner, Rainer Bodendiek

Publication date: 1984

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

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




Related Items (32)

Edge-pancyclicity of coupled graphsOn the Size of Matchings in 1-Planar Graph with High Minimum DegreeRecognizing and embedding simple optimal 2-planar graphsOn fan-crossing and fan-crossing free graphsRecognizing IC-Planar and NIC-Planar Graphs\(K_7\)-minors in optimal 1-planar graphsFan-crossing free graphs and their relationship to other beyond-planar graphsAn annotated bibliography on 1-planarityOn the recognition of fan-planar and maximal outer-fan-planar graphsThe book thickness of 1-planar graphs is constant\(\mathsf{NIC}\)-planar graphsStraight-line drawings of 1-planar graphsOn the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphsThe family of fan-planar graphsOptimal 1-planar multigraphsA new note on 1-planar graphs with minimum degree 7Recognizing optimal 1-planar graphs in linear time\(\mathsf{T}\)-shape visibility representations of 1-planar graphsOn an extremal problem in the class of bipartite 1-planar graphs1-fan-bundle-planar drawings of graphsUnnamed ItemUnnamed ItemCharacterizing and recognizing 4-map graphsOn partitioning the edges of 1-plane graphsCharacterizing 5-map graphs by 2-fan-crossing graphsOn the sizes of bipartite 1-planar graphsOptimal 1-planar graphs which triangulate other surfaces1-Planar Graphs$$\textit{\textbf{k}}$$-Planar GraphsFan-planarity: properties and complexityKlaus Wagner 1910-2000Counting cliques in 1-planar graphs




This page was built for publication: Über 1-optimale Graphen