Adaptable chromatic number of graph products

DOI10.1016/J.DISC.2009.05.029zbMATH Open1179.05045OpenAlexW2032005618MaRDI QIDQ1045010FDOQ1045010

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

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

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)

Cites Work

• On the degrees of the vertices of a directed graph
• Title not available (Why is that?)
• A survey on Hedetniemi's conjecture
• Full Constraint Satisfaction Problems
• On the adaptable chromatic number of graphs
• Adapted List Coloring of Graphs and Hypergraphs
• Adapted list coloring of planar graphs
• Circular chromatic number: A survey
• List Partitions
• Title not available (Why is that?)
• 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
• Chromatic capacities of graphs and hypergraphs
• On the upper chromatic numbers of the reals
• An upper bound on adaptable choosability of graphs
• Title not available (Why is that?)
• Ramsey properties of orientations of graphs
• Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak-Rödl function
• Star-extremal graphs and the lexicographic product
• Title not available (Why is that?)
• Sparse \(H\)-colourable graphs of bounded maximum degree
• On the bounds for the ultimate independence ratio of a graph

Cited In (8)

• 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
• 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)