The adaptable choosability number grows with the choosability number

DOI10.1016/J.DISC.2011.06.016MaRDI QIDQ641204zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The Adaptable Chromatic Number and the Chromatic Number
• An upper bound on adaptable choosability of graphs
• On the adaptable chromatic number of graphs
• An asymptotically tight bound on the adaptable chromatic number
• Adaptable chromatic number of graph products
• A note on adaptable choosability and choosability with separation of planar graphs
• The growth rate of the harmonious chromatic number
• Adaptivity is exponentially powerful for testing monotonicity of halfspaces
• On the Toeplitz properties of adaptability matrices
• An extension of Thomassen's result on choosability

Cites work

• scientific article; zbMATH DE number 446487 (Why is no real title available?)
• scientific article; zbMATH DE number 1303525 (Why is no real title available?)
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Adaptable choosability of planar graphs with sparse short cycles
• Adaptable chromatic number of graph products
• Adapted List Coloring of Graphs and Hypergraphs
• Adapted list coloring of planar graphs
• An asymptotically tight bound on the adaptable chromatic number
• An upper bound on adaptable choosability of graphs
• Full Constraint Satisfaction Problems
• List Partitions
• Matrix Partitions with Finitely Many Obstructions
• On the adaptable chromatic number of graphs
• On the upper chromatic numbers of the reals
• Split and balanced colorings of complete graphs

Cited in

(6)

• Separation choosability and dense bipartite induced subgraphs
• The Adaptable Chromatic Number and the Chromatic Number
• Algorithms to approximately count and sample conforming colorings of graphs
• Adaptable and conflict colouring multigraphs with no cycles of length three or four
• An asymptotically tight bound on the adaptable chromatic number
• On color critical graphs with large adaptable chromatic numbers

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

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