Coloring plane graphs with independent crossings

DOI10.1002/jgt.20448zbMath1208.05019arXiv0811.2702OpenAlexW2526410593WikidataQ57601418 ScholiaQ57601418MaRDI QIDQ3055915

Ladislav Stacho, Daniel Král'

Publication date: 10 November 2010

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0811.2702

zbMATH Keywords

planar graphschromatic numbercrossing numbercyclic coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (25)

Recognizing and drawing IC-planar graphs ⋮ Recognizing IC-Planar and NIC-Planar Graphs ⋮ An annotated bibliography on 1-planarity ⋮ \(\mathsf{NIC}\)-planar graphs ⋮ The structure of plane graphs with independent crossings and its applications to coloring problems ⋮ An improved upper bound for the acyclic chromatic number of 1-planar graphs ⋮ New results on edge partitions of 1-plane graphs ⋮ Weak-dynamic coloring of graphs beyond-planarity ⋮ IC-planar graphs are odd-10-colorable ⋮ The linear 2-arboricity of IC-planar graphs ⋮ L-visibility drawings of IC-planar graphs ⋮ \(\mathsf{T}\)-shape visibility representations of 1-planar graphs ⋮ Neighbor sum distinguishing total coloring of sparse IC-planar graphs ⋮ Unnamed Item ⋮ Drawing complete multipartite graphs on the plane with restrictions on crossings ⋮ Equitable coloring of three classes of 1-planar graphs ⋮ Acyclic edge coloring of IC-planar graphs ⋮ List edge coloring of outer-1-planar graphs ⋮ Neighbor sum distinguishing total choosability of IC-planar graphs ⋮ Remarks on the joins of 1-planar graphs ⋮ Equitable partition of plane graphs with independent crossings into induced forests ⋮ Acyclic coloring of IC-planar 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

• Cyclic colorings of plane graphs with independent faces
• Another step towards proving a conjecture by Plummer and Toft
• Facial colorings using Hall's theorem
• Cyclic coloring of plane graphs
• On cyclic colorings and their generalizations
• The four-colour theorem
• Cyclic, diagonal and facial colorings
• A new bound on the cyclic chromatic number
• On vertex types and cyclic colourings of 3-connected plane graphs
• Cyclic, diagonal and facial colorings -- a missing case
• Ein Sechsfarbenproblem auf der Kugel
• Cyclic Chromatic Number of 3-Connected Plane Graphs
• List Colouring Squares of Planar Graphs
• Chromatic number, independence ratio, and crossing number
• 3-Facial Coloring of Plane Graphs
• Cyclic coloration of 3-polytopes
• Every planar map is four colorable
• A new proof of the 6 color theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Coloring plane graphs with independent crossings