χ_D(G), |Aut(G)|, and a variant of the motion lemma

DOI10.26493/1855-3974.848.669zbMath1370.05058arXiv1505.03396OpenAlexW2183868186WikidataQ124829157 ScholiaQ124829157MaRDI QIDQ5357291

Sajith Padinhatteeri, Niranjan Balachandran

Publication date: 14 September 2017

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

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

zbMATH Keywords

distinguishing chromatic numbermotion lemmaautomorphism group of a graphweak product of 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) Graph operations (line graphs, products, etc.) (05C76)

Related Items (4)

The list distinguishing number of Kneser graphs ⋮ Distinguishing chromatic number of random Cayley graphs ⋮ Vertex transitive graphs G with χ_D(G) > χ(G) and small automorphism group ⋮ The distinguishing number and distinguishing chromatic number for posets

This page was built for publication: χ_D(G), |Aut(G)|, and a variant of the motion lemma