Adaptable chromatic number of graph products
From MaRDI portal
Publication:1045010
DOI10.1016/j.disc.2009.05.029zbMath1179.05045OpenAlexW2032005618MaRDI QIDQ1045010
Pavol Hell, Zhishi Pan, Xuding Zhu, Tsai-Lien Wong
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.05.029
chromatic numberCartesian productcategorical productCartesian poweradaptable chromatic numbercategorical power
Related Items (6)
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 ⋮ The adaptable choosability number grows with the choosability number ⋮ Decomposition of realizable fuzzy relations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An upper bound on adaptable choosability of graphs
- Matrix partitions with finitely many obstructions
- On the arc-chromatic number of a digraph
- On a graph colouring problem
- Split and balanced colorings of complete graphs
- A survey on Hedetniemi's conjecture
- Chromatic capacities of graphs and hypergraphs
- Sparse \(H\)-colourable graphs of bounded maximum degree
- Star-extremal graphs and the lexicographic product
- On the bounds for the ultimate independence ratio of a graph
- On the upper chromatic numbers of the reals
- On the adaptable chromatic number of graphs
- On the degrees of the vertices of a directed graph
- Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak-Rödl function
- Adapted List Coloring of Graphs and Hypergraphs
- Adapted list coloring of planar graphs
- Ramsey properties of orientations of graphs
- List Partitions
- Full Constraint Satisfaction Problems
- Circular chromatic number: A survey
This page was built for publication: Adaptable chromatic number of graph products
