Adaptable choosability of planar graphs with sparse short cycles

DOI10.1016/J.DISC.2009.05.004MaRDI QIDQ1045097zbMATH OpenOpenAlexFDO

Authors Albert Guan, Xuding Zhu

Publication date 15 December 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2009.05.004

zbMATH Keywords

adapted colouringlist colouringplanar graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Adapted list coloring of planar graphs
• A note on adaptable choosability and choosability with separation of planar graphs
• An upper bound on adaptable choosability of graphs
• A note on 3-choosability of planar graphs
• On 3-choosability of planar graphs without certain cycles

Cites work

• Adapted List Coloring of Graphs and Hypergraphs
• Adapted list coloring of planar graphs
• An upper bound on adaptable choosability of graphs
• Chromatic capacities of graphs and hypergraphs
• scientific article; zbMATH DE number 4144029 (Why is no real title available?)
• On a graph colouring problem
• On the adaptable chromatic number of graphs
• On the upper chromatic numbers of the reals
• Ramsey properties of orientations of graphs
• Split and balanced colorings of complete graphs

Cited in

(5)

• An upper bound on adaptable choosability of graphs
• Adapted List Coloring of Graphs and Hypergraphs
• A note on adaptable choosability and choosability with separation of planar graphs
• Adaptable and conflict colouring multigraphs with no cycles of length three or four
• The adaptable choosability number grows with the choosability number

This page was built for publication: Adaptable choosability of planar graphs with sparse short cycles

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