Recommendations
Cited in
(66)- The distinguishing number (index) and the domination number of a graph
- Coarse distinguishability of graphs with symmetric growth
- On the distinguishing chromatic number of the Kronecker products of graphs
- On the graphs with distinguishing number equal list distinguishing number
- Edge-locating coloring of graphs
- Transitive coloring of graphs
- Distinguishing index of Kronecker product of two graphs
- Distinguishing number and distinguishing index of strong product of two graphs
- The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs
- Trees with distinguishing number two
- Extending precolorings to distinguish group actions
- Bounds for distinguishing invariants of infinite graphs
- On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two
- Upper bounds on the locating chromatic number of trees
- The distinguishing number of the augmented cube and hypercube powers
- scientific article; zbMATH DE number 2113454 (Why is no real title available?)
- Proper distinguishing colorings with few colors for graphs with girth at least 5
- Distinguishing threshold of graphs
- Distinguishing numbers of finite 4-valent vertex-transitive graphs
- Asymmetrizing trees of maximum valence \(2^{\aleph_0}\)
- Number of distinguishing colorings and partitions
- deBruijn-like sequences and the irregular chromatic number of paths and cycles
- The chromatic distinguishing index of certain graphs
- Improving upper bounds for the distinguishing index
- Number of colors needed to break symmetries of a graph by an arbitrary edge coloring
- The distinguishing number and distinguishing chromatic number for posets
- On the comparison of the distinguishing coloring and the locating coloring of graphs
- List distinguishing parameters of trees
- The Colouring Number
- Endomorphism breaking in graphs
- Distinguishing number of hierarchical products of graphs
- Proper distinguishing arc-colourings of symmetric digraphs
- Bounds on the distinguishing chromatic number
- Distinguishing labellings of group action on vector spaces and graphs
- Distinguishing chromatic numbers of bipartite graphs
- The distinguishing chromatic number of Cartesian products of two complete graphs
- Upper bounds for the automorphic chromatic index of a graph
- Bounding the distinguishing number of infinite graphs and permutation groups
- Distinguishing numbers and distinguishing indices of oriented graphs
- On the automorphic chromatic index of a graph
- 3-regular maps on closed surfaces are nearly distinguishing 3-colorable with few exceptions
- Bipartite polyhedral maps on closed surfaces are distinguishing 3-colorable with few exceptions
- The hunting of a snark with total chromatic number 5
- Distinguishing infinite graphs with bounded degrees
- Distinguishing and distinguishing chromatic numbers of generalized Petersen graphs
- Distinguishing geometric graphs
- Distinguishing chromatic numbers of complements of Cartesian products of complete graphs
- Nordhaus-Gaddum theorem for the distinguishing chromatic number
- List-distinguishing colorings of graphs
- Graphs with large distinguishing chromatic number
- Distinguishability of locally finite trees
- The distinguishing number and the distinguishing index of line and graphoidal graph(s)
- Trees with distinguishing index equal distinguishing number plus one
- Distinguishing chromatic numbers of wreath products
- Automorphisms and distinguishing numbers of geometric cliques
- Distinguishing graphs by edge-colourings
- On the local distinguishing chromatic number
- The distinguishing number of Cartesian products of complete graphs
- Eternal chromatic number
- On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results
- Distinguishing arc-colourings of symmetric digraphs
- Vertex transitive graphs \(G\) with \(\chi_D (G)>\chi(G)\) and small automorphism group
- Distinguishing chromatic number of random Cayley graphs
- Equitable distinguishing chromatic number
- On the distinguishing number of functigraphs
- Distinguishing graphs of maximum valence 3
This page was built for publication: The distinguishing chromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q815210)
