\(k\)-tuple chromatic number of the Cartesian product of graphs

DOI10.1016/j.endm.2015.07.041zbMath1347.05059OpenAlexW2214907393MaRDI QIDQ324798

Pablo Torres, Ivo Koch, Mario Valencia-Pabon, Flavia Bonomo-Braberman

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.041

zbMATH Keywords

Cayley graphsCartesian product of graphs\(k\)-tuple coloringshom-idempotent graphsKneser graphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Kneser's conjecture, chromatic number, and homotopy
• n-tuple colorings and associated graphs
• Set colourings of graphs
• On normal Cayley graphs and hom-idempotent graphs
• The multichromatic numbers of some Kneser graphs
• On the ultimate independence ratio of a graph
• Graphs with Given Group and Given Graph-Theoretical Properties

This page was built for publication: \(k\)-tuple chromatic number of the Cartesian product of graphs