Bounds on the distinguishing chromatic number
From MaRDI portal
Publication:2380243
zbMATH Open1186.05051MaRDI QIDQ2380243FDOQ2380243
Authors: Karen L. Collins, Ann Trenk, Mark Hovey 
Publication date: 26 March 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/224898
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 (18)
- Distinguishing maps
- The distinguishing chromatic number
- Distinguishing chromatic number of random Cayley graphs
- Distinguishing chromatic numbers of complements of Cartesian products of complete graphs
- Nordhaus-Gaddum theorem for the distinguishing chromatic number
- Graphs with large distinguishing chromatic number
- Title not available (Why is that?)
- Proper distinguishing colorings with few colors for graphs with girth at least 5
- Distinguishing chromatic numbers of wreath products
- A bound on the total chromatic number
- The distinguishing chromatic number of Kneser graphs
- On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two
- Distinguishing graphs by edge-colourings
- Vertex transitive graphs \(G\) with \(\chi_D (G)>\chi(G)\) and small automorphism group
- Improving upper bounds for the distinguishing index
- On the local distinguishing chromatic number
- Automorphisms and distinguishing numbers of geometric cliques
- The distinguishing number and distinguishing chromatic number for posets
This page was built for publication: Bounds on the distinguishing chromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380243)
