k-tuple chromatic number of the Cartesian product of graphs

DOI10.1016/J.ENDM.2015.07.041zbMATH Open1347.05059OpenAlexW2214907393MaRDI QIDQ324798FDOQ324798

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

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

zbMATH Keywords

Cayley graphsCartesian product of graphs\(k\)-tuple coloringshom-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)

Cites Work

• Kneser's conjecture, chromatic number, and homotopy
• Graphs with Given Group and Given Graph-Theoretical Properties
• 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

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)