On drawings and decompositions of 1-planar graphs

zbMath1295.05084MaRDI QIDQ396768

Július Czap, David E. Hudak

Publication date: 14 August 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i2p54

zbMATH Keywords

planar graphforest1-planar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (19)

An annotated bibliography on 1-planarity ⋮ 1-planar graphs are odd 13-colorable ⋮ A note on 1-planar graphs ⋮ All 2-planar graphs having the same spanning subgraph ⋮ On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs ⋮ New results on edge partitions of 1-plane graphs ⋮ A new note on 1-planar graphs with minimum degree 7 ⋮ On an extremal problem in the class of bipartite 1-planar graphs ⋮ On partitioning the edges of 1-plane graphs ⋮ Embedding-preserving rectangle visibility representations of nonplanar graphs ⋮ The matching extendability of optimal 1-planar graphs ⋮ Edge partitions of optimal 2-plane and 3-plane graphs ⋮ Compact drawings of 1-planar graphs with right-angle crossings and few bends ⋮ Light edges in 3-connected 2-planar graphs with prescribed minimum degree ⋮ Ortho-polygon visibility representations of embedded graphs ⋮ 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 ⋮ Edge Partitions and Visibility Representations of 1-planar Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• 1-planarity of complete multipartite graphs
• Ein 7-Farbensatz 1-einbettbarer Graphen auf der projektiven Ebene
• A linear-time algorithm for 7-coloring 1-plane graphs
• The structure of 1-planar graphs
• Optimal 1-planar graphs which triangulate other surfaces
• Graphs drawn with few crossings per edge
• Ein Sechsfarbenproblem auf der Kugel
• On properties of maximal 1-planar graphs
• Crossing Number is NP-Complete
• Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
• A new proof of the 6 color theorem

This page was built for publication: On drawings and decompositions of 1-planar graphs