Graphs with large distinguishing chromatic number

zbMath1266.05025MaRDI QIDQ1953399

Michael S. Cavers, Karen Seyffarth

Publication date: 7 June 2013

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i1p19

zbMATH Keywords

graph colouringgraph automorphismdistinguishing numberdistinguishing chromatic number

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (6)

Proper distinguishing colorings with few colors for graphs with girth at least 5 ⋮ Trees with distinguishing index equal distinguishing number plus one ⋮ Nordhaus-Gaddum theorem for the distinguishing chromatic number ⋮ On the comparison of the distinguishing coloring and the locating coloring of graphs ⋮ Upper bounds on the locating chromatic number of trees ⋮ Distinguishing chromatic numbers of complements of Cartesian products of complete graphs

This page was built for publication: Graphs with large distinguishing chromatic number