Distinguishing chromatic numbers of complements of Cartesian products of complete graphs

DOI10.1016/j.disc.2018.05.016zbMath1392.05036OpenAlexW2807476228MaRDI QIDQ724854

Ethan P. White, Karen Seyffarth, Michael S. Cavers

Publication date: 26 July 2018

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

Full work available at URL: https://doi.org/10.1016/j.disc.2018.05.016

zbMATH Keywords

graph colouringCartesian productdistinguishing chromatic number

Mathematics Subject Classification ID

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

Related Items (1)

Equitable distinguishing chromatic number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nordhaus-Gaddum theorem for the distinguishing chromatic number
• The distinguishing chromatic number
• The distinguishing chromatic number of Cartesian products of two complete graphs
• Distinguishing and distinguishing chromatic numbers of generalized Petersen graphs
• On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results
• Graphs with large distinguishing chromatic number
• The distinguishing chromatic number of Kneser graphs
• Distinguishing chromatic numbers of bipartite graphs
• Bounds on the distinguishing chromatic number
• The distinguishing number of Cartesian products of complete graphs
• Distinguishing Chromatic Number of Cartesian Products of Graphs
• Breaking the Symmetries of the Book Graph and the Generalized Petersen Graph
• On distinquishing numbers
• Distinguishing Cartesian powers of graphs
• Distinguishing Cartesian powers of graphs

This page was built for publication: Distinguishing chromatic numbers of complements of Cartesian products of complete graphs