Circular degree choosability

MaRDI QIDQ1010827zbMATH OpenFDO

Authors Serguei Norine, Xuding Zhu

Publication date 7 April 2009

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/129712, http://www.emis.de/journals/EJC/Volume_15/Abstracts/v15i1r100.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

circular list coloringsdegree choosable graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Circular choosability of graphs
• Circular choosability
• Circular choosability is rational
• Circular consecutive choosability of graphs
• Circular choosability of planar graphs with large girth.

Cited in

(4)

• On two questions about circular choosability
• Circular choosability of graphs
• Circular choosability is rational
• Brooks' theorem via the Alon-Tarsi theorem

This page was built for publication: Circular degree choosability

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