Distinguishing chromatic number of random Cayley graphs

DOI10.1016/j.disc.2017.06.002zbMath1367.05063arXiv1406.5358OpenAlexW2963702422MaRDI QIDQ2012532

Niranjan Balachandran, Sajith Padinhatteeri

Publication date: 1 August 2017

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

Full work available at URL: https://arxiv.org/abs/1406.5358

zbMATH Keywords

distinguishing chromatic numberrandom Cayley graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

The distinguishing number and distinguishing chromatic number for posets

Cites Work

• Unnamed Item
• The distinguishing chromatic number
• On the automorphism groups of almost all Cayley graphs
• Symmetry breaking in graphs
• Bounds on the distinguishing chromatic number
• The chromatic number of random Cayley graphs
• The Minimal Base Size of Primitive Solvable Permutation Groups
• χ_D(G), |Aut(G)|, and a variant of the motion lemma
• On the Chromatic Number of Random Cayley Graphs

This page was built for publication: Distinguishing chromatic number of random Cayley graphs