An upper bound on adaptable choosability of graphs

DOI10.1016/J.EJC.2008.06.003zbMath1209.05094OpenAlexW2145006492MaRDI QIDQ1003583

Mickaël Montassier, Xuding Zhu, Andre Raspaud

Publication date: 4 March 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2008.06.003

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (6)

Adaptable and conflict colouring multigraphs with no cycles of length three or four ⋮ Adapted game colouring of graphs ⋮ The adaptable choosability number grows with the choosability number ⋮ Adapted list coloring of planar graphs ⋮ Adaptable chromatic number of graph products ⋮ Adaptable choosability of planar graphs with sparse short cycles

Cites Work

• Adaptable choosability of planar graphs with sparse short cycles
• On the degrees of the vertices of a directed graph
• Adapted List Coloring of Graphs and Hypergraphs
• Adapted list coloring of planar graphs
• List Partitions
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Full Constraint Satisfaction Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An upper bound on adaptable choosability of graphs