Circular consecutive choosability of graphs

DOI10.11650/TWJM/1500404989zbMATH Open1162.05316OpenAlexW4235605548MaRDI QIDQ947046FDOQ947046

Authors: Wensong Lin, Daqing Yang, Chung-Ying Yang, Xuding Zhu 

Publication date: 29 September 2008

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.11650/twjm/1500404989

Recommendations

• Circular consecutive choosability of \(k\)-choosable graphs
• Circular choosability
• Circular choosability of graphs
• On two questions about circular choosability
• CONSECUTIVE LIST COLOURING AND A NEW GRAPH INVARIANT

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (11)

• Circular choosability
• On two questions about circular choosability
• Circular choosability of planar graphs with large girth.
• Circular degree choosability
• Circular choosability of graphs
• CONSECUTIVE LIST COLOURING AND A NEW GRAPH INVARIANT
• Circular choosability is rational
• List circular coloring of trees and cycles
• Circular choosability via combinatorial Nullstellensatz
• Circular list colorings of some graphs
• Circular consecutive choosability of \(k\)-choosable graphs

This page was built for publication: Circular consecutive choosability of graphs

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