A new bound on the cyclic chromatic number

DOI10.1006/JCTB.2001.2046zbMATH Open1027.05044OpenAlexW2008666375MaRDI QIDQ1850557FDOQ1850557

Authors: Daniel P. Sanders, Yue Zhao 

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2001.2046

Recommendations

• A new upper bound on the cyclic chromatic number
• On cyclic colorings and their generalizations
• A general upper bound for the cyclic chromatic number of 3-connected plane graphs
• Third case of the cyclic coloring conjecture
• Cyclic chromatic number of 3-connected plane graphs

zbMATH Keywords

angular coloringface coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Every planar map is four colorable. I: Discharging
• Title not available (Why is that?)
• The four-colour theorem
• Title not available (Why is that?)
• Title not available (Why is that?)
• On cyclic colorings and their generalizations

Cited In (24)

• Coloring the faces of convex polyhedra so that like colors are far apart
• A survey on the cyclic coloring and its relaxations
• Parity vertex colouring of plane graphs
• Cyclic coloring of plane graphs with maximum face size 16 and 17
• New Bounds for the Dichromatic Number of a Digraph
• New approximation guarantee for chromatic number
• Facial rainbow edge-coloring of plane graphs
• Cyclic 4-colorings of graphs on surfaces
• Facially-constrained colorings of plane graphs: a survey
• Third case of the cyclic coloring conjecture
• Facial rainbow coloring of plane graphs
• On the cyclic coloring conjecture
• Third case of the cyclic coloring conjecture
• Facial colorings using Hall's theorem
• Another step towards proving a conjecture by Plummer and Toft
• Title not available (Why is that?)
• Cyclic, diagonal and facial colorings
• A general upper bound for the cyclic chromatic number of 3-connected plane graphs
• Cyclic colorings of plane graphs with independent faces
• A bound on the chromatic number of the square of a planar graph
• Facial nonrepetitive vertex coloring of plane graphs
• Coloring plane graphs with independent crossings
• Coverage with \(k\)-transmitters in the presence of obstacles
• A unified approach to distance-two colouring of graphs on surfaces

This page was built for publication: A new bound on the cyclic chromatic number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850557)