The distinguishing chromatic number
From MaRDI portal
Publication:815210
zbMATH Open1081.05033MaRDI QIDQ815210FDOQ815210
Authors: Karen L. Collins, Ann Trenk 
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Cited In (66)
- Distinguishing index of Kronecker product of two graphs
- Distinguishing number and distinguishing index of strong product of two graphs
- Edge-locating coloring of graphs
- Transitive coloring of graphs
- The distinguishing number (index) and the domination number of a graph
- Coarse distinguishability of graphs with symmetric growth
- On the graphs with distinguishing number equal list distinguishing number
- On the distinguishing chromatic number of the Kronecker products of graphs
- The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs
- Extending precolorings to distinguish group actions
- Upper bounds on the locating chromatic number of trees
- List distinguishing parameters of trees
- Endomorphism breaking in graphs
- On the distinguishing number of functigraphs
- Distinguishing numbers of finite 4-valent vertex-transitive graphs
- Distinguishability of locally finite trees
- Bounds for distinguishing invariants of infinite graphs
- On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results
- Distinguishing chromatic number of random Cayley graphs
- On the comparison of the distinguishing coloring and the locating coloring of graphs
- Distinguishing numbers and distinguishing indices of oriented graphs
- Distinguishing chromatic numbers of complements of Cartesian products of complete graphs
- Title not available (Why is that?)
- Nordhaus-Gaddum theorem for the distinguishing chromatic number
- The distinguishing chromatic number of Cartesian products of two complete graphs
- Distinguishing and distinguishing chromatic numbers of generalized Petersen graphs
- Graphs with large distinguishing chromatic number
- Distinguishing arc-colourings of symmetric digraphs
- On the automorphic chromatic index of a graph
- Equitable distinguishing chromatic number
- Distinguishing threshold of graphs
- Trees with distinguishing number two
- The distinguishing number of the augmented cube and hypercube powers
- Bounds on the distinguishing chromatic number
- Upper bounds for the automorphic chromatic index of a graph
- Bounding the distinguishing number of infinite graphs and permutation groups
- The distinguishing number of Cartesian products of complete graphs
- Proper distinguishing colorings with few colors for graphs with girth at least 5
- Distinguishing chromatic numbers of wreath products
- Distinguishing number of hierarchical products of graphs
- 3-regular maps on closed surfaces are nearly distinguishing 3-colorable with few exceptions
- The Colouring Number
- Distinguishing labellings of group action on vector spaces and graphs
- On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two
- The hunting of a snark with total chromatic number 5
- Distinguishing graphs of maximum valence 3
- Distinguishing graphs by edge-colourings
- Number of distinguishing colorings and partitions
- Distinguishing chromatic numbers of bipartite graphs
- Distinguishing geometric graphs
- Vertex transitive graphs \(G\) with \(\chi_D (G)>\chi(G)\) and small automorphism group
- Improving upper bounds for the distinguishing index
- deBruijn-like sequences and the irregular chromatic number of paths and cycles
- Bipartite polyhedral maps on closed surfaces are distinguishing 3-colorable with few exceptions
- On the local distinguishing chromatic number
- Distinguishing infinite graphs with bounded degrees
- List-distinguishing colorings of graphs
- The chromatic distinguishing index of certain graphs
- Proper distinguishing arc-colourings of symmetric digraphs
- Automorphisms and distinguishing numbers of geometric cliques
- The distinguishing number and distinguishing chromatic number for posets
- Eternal chromatic number
- Asymmetrizing trees of maximum valence \(2^{\aleph_0}\)
- Number of colors needed to break symmetries of a graph by an arbitrary edge coloring
- The distinguishing number and the distinguishing index of line and graphoidal graph(s)
- Trees with distinguishing index equal distinguishing number plus one
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)
