The structure of plane graphs with independent crossings and its applications to coloring problems

DOI10.2478/s11533-012-0094-7zbMath1258.05028OpenAlexW2004916648MaRDI QIDQ1935605

Xin Zhang, Gui Zhen Liu

Publication date: 18 February 2013

Published in: Central European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/s11533-012-0094-7

zbMATH Keywords

coloringlight edgedischargingIC-planar graphindependent crossingindependent crossing planar graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (20)

Recognizing and drawing IC-planar graphs ⋮ Recognizing IC-Planar and NIC-Planar Graphs ⋮ An annotated bibliography on 1-planarity ⋮ \(\mathsf{NIC}\)-planar graphs ⋮ New results on edge partitions of 1-plane graphs ⋮ L-visibility drawings of IC-planar graphs ⋮ \(\mathsf{T}\)-shape visibility representations of 1-planar graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Drawing complete multipartite graphs on the plane with restrictions on crossings ⋮ Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity ⋮ On \((p, 1)\)-total labelling of NIC-planar graphs ⋮ Equitable coloring of three classes of 1-planar graphs ⋮ Unnamed Item ⋮ Remarks on the joins of 1-planar graphs ⋮ The maximal 1-planarity and crossing numbers of graphs ⋮ Edge Partitions and Visibility Representations of 1-planar Graphs ⋮ Drawing graph joins in the plane with restrictions on crossings ⋮ IC-Planar Graphs Are 6-Choosable

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• List edge and list total coloring of 1-planar graphs
• The structure of 1-planar graphs
• List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
• Graphs drawn with few crossings per edge
• List edge and list total colourings of multigraphs
• Planar graphs of maximum degree seven are Class I
• On edge colorings of \(1\)-planar graphs
• On total colorings of 1-planar graphs
• Ein Sechsfarbenproblem auf der Kugel
• A Planar linear arboricity conjecture
• Coloring plane graphs with independent crossings
• 5-Coloring Graphs with 4 Crossings
• The linear arboricity of planar graphs of maximum degree seven is four
• Chromatic number, independence ratio, and crossing number
• On total 9-coloring planar graphs of maximum degree seven
• A new proof of the 6 color theorem

This page was built for publication: The structure of plane graphs with independent crossings and its applications to coloring problems