The distinguishing chromatic number

zbMath1081.05033MaRDI QIDQ815210

Ann N. Trenk, Karen L. Collins

Publication date: 16 February 2006

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

Full work available at URL: https://eudml.org/doc/125578

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15)

Related Items (49)

Bounds for distinguishing invariants of infinite graphs ⋮ The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs ⋮ Distinguishing arc-colourings of symmetric digraphs ⋮ Number of colors needed to break symmetries of a graph by an arbitrary edge coloring ⋮ Equitable distinguishing chromatic number ⋮ Extending precolorings to distinguish group actions ⋮ The distinguishing number (index) and the domination number of a graph ⋮ Proper distinguishing colorings with few colors for graphs with girth at least 5 ⋮ Distinguishing number and distinguishing index of strong product of two graphs ⋮ Distinguishing number of hierarchical products of graphs ⋮ Trees with distinguishing index equal distinguishing number plus one ⋮ On the automorphic chromatic index of a graph ⋮ Nordhaus-Gaddum theorem for the distinguishing chromatic number ⋮ Asymmetrizing trees of maximum valence \(2^{\aleph_0}\) ⋮ Distinguishing threshold of graphs ⋮ Endomorphism breaking in graphs ⋮ Distinguishing infinite graphs with bounded degrees ⋮ On the comparison of the distinguishing coloring and the locating coloring of graphs ⋮ 3-regular maps on closed surfaces are nearly distinguishing 3-colorable with few exceptions ⋮ On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two ⋮ Bipartite polyhedral maps on closed surfaces are distinguishing 3-colorable with few exceptions ⋮ The distinguishing number of Cartesian products of complete graphs ⋮ Distinguishing numbers and distinguishing indices of oriented graphs ⋮ Improving upper bounds for the distinguishing index ⋮ Unnamed Item ⋮ Upper bounds on the locating chromatic number of trees ⋮ Distinguishing graphs by edge-colourings ⋮ Automorphisms and distinguishing numbers of geometric cliques ⋮ The distinguishing number and the distinguishing index of line and graphoidal graph(s) ⋮ The chromatic distinguishing index of certain graphs ⋮ The distinguishing number of the augmented cube and hypercube powers ⋮ The distinguishing chromatic number of Cartesian products of two complete graphs ⋮ Distinguishing chromatic number of random Cayley graphs ⋮ Distinguishing graphs of maximum valence 3 ⋮ Distinguishing chromatic numbers of complements of Cartesian products of complete graphs ⋮ Distinguishing labellings of group action on vector spaces and graphs ⋮ Distinguishing index of Kronecker product of two graphs ⋮ On the local distinguishing chromatic number ⋮ Upper bounds for the automorphic chromatic index of a graph ⋮ Bounding the distinguishing number of infinite graphs and permutation groups ⋮ Vertex transitive graphs G with χ_D(G) > χ(G) and small automorphism group ⋮ Number of distinguishing colorings and partitions ⋮ Distinguishing numbers of finite 4-valent vertex-transitive graphs ⋮ Proper distinguishing arc-colourings of symmetric digraphs ⋮ On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results ⋮ deBruijn-like sequences and the irregular chromatic number of paths and cycles ⋮ The distinguishing number and distinguishing chromatic number for posets ⋮ On the distinguishing number of functigraphs ⋮ Coarse distinguishability of graphs with symmetric growth

This page was built for publication: The distinguishing chromatic number