\(k\)-tuple colorings of the Cartesian product of graphs

DOI10.1016/j.dam.2017.02.003zbMath1387.05217OpenAlexW2593366209MaRDI QIDQ1752494

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

Publication date: 24 May 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.02.003

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (2)

Thinness of product graphs ⋮ Independence number of products of Kneser graphs

Cites Work

• Unnamed Item
• Kneser's conjecture, chromatic number, and homotopy
• Homomorphisms of 3-chromatic graphs
• 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
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

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