The following pages link to The distinguishing chromatic number (Q815210):
Displaying 50 items.
- Nordhaus-Gaddum theorem for the distinguishing chromatic number (Q396886) (← links)
- Endomorphism breaking in graphs (Q405090) (← links)
- Distinguishing graphs by edge-colourings (Q482130) (← links)
- On the automorphic chromatic index of a graph (Q604996) (← links)
- On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two (Q626859) (← links)
- List-distinguishing colorings of graphs (Q640414) (← links)
- Distinguishing chromatic numbers of complements of Cartesian products of complete graphs (Q724854) (← links)
- Upper bounds for the automorphic chromatic index of a graph (Q742607) (← links)
- Bounding the distinguishing number of infinite graphs and permutation groups (Q743653) (← links)
- Number of distinguishing colorings and partitions (Q776312) (← links)
- Distinguishability of locally finite trees (Q874003) (← links)
- 3-regular maps on closed surfaces are nearly distinguishing 3-colorable with few exceptions (Q897252) (← links)
- Automorphisms and distinguishing numbers of geometric cliques (Q938315) (← links)
- The distinguishing chromatic number of Cartesian products of two complete graphs (Q973145) (← links)
- Distinguishing and distinguishing chromatic numbers of generalized Petersen graphs (Q1011889) (← links)
- On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results (Q1044994) (← links)
- deBruijn-like sequences and the irregular chromatic number of paths and cycles (Q1045102) (← links)
- Extending precolorings to distinguish group actions (Q1645056) (← links)
- Proper distinguishing colorings with few colors for graphs with girth at least 5 (Q1658779) (← links)
- Bipartite polyhedral maps on closed surfaces are distinguishing 3-colorable with few exceptions (Q1696528) (← links)
- Upper bounds on the locating chromatic number of trees (Q1730257) (← links)
- List distinguishing parameters of trees (Q1946232) (← links)
- Graphs with large distinguishing chromatic number (Q1953399) (← links)
- Distinguishing chromatic number of random Cayley graphs (Q2012532) (← links)
- Proper distinguishing arc-colourings of symmetric digraphs (Q2079126) (← links)
- The distinguishing number and distinguishing chromatic number for posets (Q2088064) (← links)
- Equitable distinguishing chromatic number (Q2147524) (← links)
- Trees with distinguishing index equal distinguishing number plus one (Q2175243) (← links)
- Trees with distinguishing number two (Q2176156) (← links)
- Asymmetrizing trees of maximum valence \(2^{\aleph_0}\) (Q2189429) (← links)
- Distinguishing numbers and distinguishing indices of oriented graphs (Q2197442) (← links)
- Distinguishing graphs of maximum valence 3 (Q2278113) (← links)
- On the local distinguishing chromatic number (Q2293833) (← links)
- On the distinguishing number of functigraphs (Q2333653) (← links)
- Bounds for distinguishing invariants of infinite graphs (Q2363696) (← links)
- Distinguishing chromatic numbers of bipartite graphs (Q2380231) (← links)
- The distinguishing number of Cartesian products of complete graphs (Q2427541) (← links)
- The hunting of a snark with total chromatic number 5 (Q2448882) (← links)
- The distinguishing number of the augmented cube and hypercube powers (Q2483424) (← links)
- Distinguishing labellings of group action on vector spaces and graphs (Q2509274) (← links)
- Distinguishing number of hierarchical products of graphs (Q2662361) (← links)
- Eternal chromatic number (Q2878221) (← links)
- Distinguishing geometric graphs (Q3419706) (← links)
- The Colouring Number (Q3701415) (← links)
- Improving upper bounds for the distinguishing index (Q4604514) (← links)
- (Q4824884) (← links)
- Distinguishing index of Kronecker product of two graphs (Q4958047) (← links)
- The distinguishing number (index) and the domination number of a graph (Q4986551) (← links)
- Distinguishing numbers of finite 4-valent vertex-transitive graphs (Q4993953) (← links)
- Distinguishing number and distinguishing index of strong product of two graphs (Q4998754) (← links)
