The adaptable choosability number grows with the choosability number

DOI10.1016/J.DISC.2011.06.016zbMATH Open1250.05049OpenAlexW2015153338MaRDI QIDQ641204FDOQ641204

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

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

zbMATH Keywords

list coloringadaptable choosabilityadaptable coloringedge labeling

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• Separation choosability and dense bipartite induced subgraphs
• The Adaptable Chromatic Number and the Chromatic Number
• Adaptable and conflict colouring multigraphs with no cycles of length three or four
• Algorithms to approximately count and sample conforming colorings of graphs
• 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)