Circular choosability of graphs

DOI10.1002/JGT.20051MaRDI QIDQ4667800zbMATH OpenOpenAlexFDO

Authors Xuding Zhu

Publication date 21 April 2005

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

Full work available at URL https://doi.org/10.1002/jgt.20051

zbMATH Keywords

\(k\)-degenerate graphscircular chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Recommendations

• Circular choosability
• Circular consecutive choosability of graphs
• On two questions about circular choosability
• Circular degree choosability
• Circular choosability is rational

Cited in

(14)

• Circular degree choosability
• Circular choosability is rational
• On chromatic numbers of two extensions of planar graphs
• Circular choosability of planar graphs with large girth.
• Circular consecutive choosability of k-choosable graphs
• Mixing homomorphisms, recolorings, and extending circular precolorings
• On two questions about circular choosability
• Circular choosability via combinatorial Nullstellensatz
• Circular choosability
• Randomly colouring graphs (a combinatorial view)
• Spanning Trees—Short or Small
• Brooks' theorem via the Alon-Tarsi theorem
• Circular list colorings of some graphs
• Circular consecutive choosability of graphs

This page was built for publication: Circular choosability of graphs

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