An upper bound on adaptable choosability of graphs
From MaRDI portal
Recommendations
- A note on adaptable choosability and choosability with separation of planar graphs
- A refinement of choosability of graphs
- Adaptable choosability of planar graphs with sparse short cycles
- On the adaptable chromatic number of graphs
- An improved upper bound on edge weight choosability of graphs
- On the choosability of some graphs
- scientific article; zbMATH DE number 15164
- Acyclic choosability of graphs with bounded degree
- An asymptotically tight bound on the adaptable chromatic number
- scientific article; zbMATH DE number 3735847
Cites work
- scientific article; zbMATH DE number 434910 (Why is no real title available?)
- scientific article; zbMATH DE number 446487 (Why is no real title available?)
- scientific article; zbMATH DE number 3604926 (Why is no real title available?)
- Adaptable choosability of planar graphs with sparse short cycles
- Adapted List Coloring of Graphs and Hypergraphs
- Adapted list coloring of planar graphs
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Full Constraint Satisfaction Problems
- List Partitions
- On the degrees of the vertices of a directed graph
- Two algorithms for general list matrix partitions
Cited in
(9)- Adaptable chromatic number of graph products
- On the adaptable chromatic number of graphs
- Adapted list coloring of planar graphs
- The adaptable choosability number grows with the choosability number
- Adapted game colouring of graphs
- An asymptotically tight bound on the adaptable chromatic number
- Adaptable choosability of planar graphs with sparse short cycles
- Adapted List Coloring of Graphs and Hypergraphs
- Adaptable and conflict colouring multigraphs with no cycles of length three or four
This page was built for publication: An upper bound on adaptable choosability of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1003583)
