Adaptable chromatic number of graph products

DOI10.1016/J.DISC.2009.05.029MaRDI QIDQ1045010zbMATH OpenOpenAlexFDO

Authors Pavol Hell, Zhishi Pan, Tsai-Lien Wong, Xuding Zhu

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

zbMATH Keywords

chromatic numberCartesian productcategorical productCartesian poweradaptable chromatic numbercategorical power

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• On the adaptable chromatic number of graphs
• The Adaptable Chromatic Number and the Chromatic Number
• On color critical graphs with large adaptable chromatic numbers
• scientific article; zbMATH DE number 4093485
• An upper bound on adaptable choosability of graphs

Cites work

• scientific article; zbMATH DE number 3162392 (Why is no real title available?)
• scientific article; zbMATH DE number 4144029 (Why is no real title available?)
• scientific article; zbMATH DE number 1096962 (Why is no real title available?)
• scientific article; zbMATH DE number 1550912 (Why is no real title available?)
• A survey on Hedetniemi's conjecture
• Adapted List Coloring of Graphs and Hypergraphs
• Adapted list coloring of planar graphs
• An upper bound on adaptable choosability of graphs
• Chromatic capacities of graphs and hypergraphs
• Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak-Rödl function
• Circular chromatic number: A survey
• Full Constraint Satisfaction Problems
• List Partitions
• Matrix partitions with finitely many obstructions
• On a graph colouring problem
• On the adaptable chromatic number of graphs
• On the arc-chromatic number of a digraph
• On the bounds for the ultimate independence ratio of a graph
• On the degrees of the vertices of a directed graph
• On the upper chromatic numbers of the reals
• Ramsey properties of orientations of graphs
• Sparse \(H\)-colourable graphs of bounded maximum degree
• Split and balanced colorings of complete graphs
• Star-extremal graphs and the lexicographic product

Cited in

(8)

• 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
• The adaptable choosability number grows with the choosability number
• On color critical graphs with large adaptable chromatic numbers
• Interleaved adjoints of directed graphs
• Decomposition of realizable fuzzy relations
• On the adaptable chromatic number of graphs

This page was built for publication: Adaptable chromatic number of graph products

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