Adaptable choosability of planar graphs with sparse short cycles

DOI10.1016/j.disc.2009.05.004zbMath1198.05048OpenAlexW2011265502MaRDI QIDQ1045097

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

planar graphslist colouringadapted colouring

Mathematics Subject Classification ID

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

Related Items (3)

Adaptable and conflict colouring multigraphs with no cycles of length three or four ⋮ The adaptable choosability number grows with the choosability number ⋮ An upper bound on adaptable choosability of graphs

Cites Work

• Unnamed Item
• An upper bound on adaptable choosability of graphs
• On a graph colouring problem
• Split and balanced colorings of complete graphs
• Chromatic capacities of graphs and hypergraphs
• On the upper chromatic numbers of the reals
• On the adaptable chromatic number of graphs
• Adapted List Coloring of Graphs and Hypergraphs
• Adapted list coloring of planar graphs
• Ramsey properties of orientations of graphs

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