An upper bound on adaptable choosability of graphs
From MaRDI portal
Publication:1003583
DOI10.1016/j.ejc.2008.06.003zbMath1209.05094MaRDI QIDQ1003583
Xuding Zhu, Mickaël Montassier, 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
05C35: Extremal problems in graph theory
05C15: Coloring of graphs and hypergraphs
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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