Circular list colorings of some graphs

DOI10.1007/BF02831929MaRDI QIDQ815980zbMATH OpenOpenAlexFDO

Authors Jiguo Yu, Guanghui Wang, Guizhen Liu

Publication date 20 February 2006

Published in Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02831929

zbMATH Keywords

outerplanar graphwheelcircular choosability circular chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On two questions about circular choosability
• Circular choosability
• Circular choosability of graphs
• Circular consecutive choosability of graphs
• scientific article; zbMATH DE number 1990691

Cites work

• Chromatic sums of nonseparable simple maps on the plane.
• Chromatic sums of singular maps on some surfaces.
• Circular choosability of graphs
• Circular chromatic number: A survey
• Colorings and orientations of graphs
• Graph theory with applications
• List circular coloring of trees and cycles
• Star chromatic number

Cited in

(7)

• List circular coloring of trees and cycles
• Fractional, circular, and defective coloring of series-parallel graphs
• List coloring of graphs having cycles of length divisible by a given number
• Acyclic sum-list-colouring of cylinders
• Circular choosability
• Circular consecutive choosability of \(k\)-choosable graphs
• Circular choosability via combinatorial Nullstellensatz

This page was built for publication: Circular list colorings of some graphs

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