k-tuple chromatic number of the Cartesian product of graphs

DOI10.1016/J.ENDM.2015.07.041MaRDI QIDQ324798zbMATH OpenOpenAlexFDO

Authors Ivo Koch, P. Torres, Mario Valencia-Pabon, Flavia Bonomo

Publication date 17 October 2016

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

zbMATH Keywords

\(k\)-tuple coloringsCartesian product of graphsCayley graphshom-idempotent graphsKneser graphs

Mathematics Subject Classification ID

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

Recommendations

• \(k\)-tuple colorings of the Cartesian product of graphs
• t-tone colorings in the Cartesian product
• Cartesian product graphs and \(k\)-tuple total domination
• scientific article; zbMATH DE number 166081
• The b -chromatic number of the cartesian product of two graphs

Cites work

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

Cited in

(1)

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

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

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