The adaptable choosability number grows with the choosability number

DOI10.1016/j.disc.2011.06.016zbMath1250.05049OpenAlexW2015153338MaRDI QIDQ641204

Juan-Miguel Gracia

Publication date: 21 October 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

list coloringadaptable choosabilityadaptable coloringedge labeling

Mathematics Subject Classification ID

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

Related Items (5)

Algorithms to approximately count and sample conforming colorings of graphs ⋮ On color critical graphs with large adaptable chromatic numbers ⋮ Adaptable and conflict colouring multigraphs with no cycles of length three or four ⋮ The Adaptable Chromatic Number and the Chromatic Number ⋮ Separation Choosability and Dense Bipartite Induced Subgraphs

Cites Work

• Unnamed Item
• Unnamed Item
• An upper bound on adaptable choosability of graphs
• Adaptable chromatic number of graph products
• Adaptable choosability of planar graphs with sparse short cycles
• Split and balanced colorings of complete graphs
• On the upper chromatic numbers of the reals
• On the adaptable chromatic number of graphs
• Matrix Partitions with Finitely Many Obstructions
• Adapted List Coloring of Graphs and Hypergraphs
• Adapted list coloring of planar graphs
• List Partitions
• An asymptotically tight bound on the adaptable chromatic number
• Full Constraint Satisfaction Problems
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: The adaptable choosability number grows with the choosability number