Name
Abstract | ||
|---|---|---|
This paper brings together two concepts in the theory of graph colourings: edge or total colourings distinguishing adjacent vertices and those breaking symmetries of a graph. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.dam.2017.07.034 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Symmetry breaking in graphs,1-2-3 Conjecture,1-2 Conjecture,Distinguishing index,Total distinguishing index | Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Existential quantification,Automorphism,Conjecture,Mathematics,Homogeneous space | Journal |
Volume | Issue | ISSN |
232 | C | 0166-218X |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rafał Kalinowski | 1 | 48 | 10.75 |
| Monika Pilśniak | 2 | 28 | 9.31 |
| Mariusz Woźniak | 3 | 204 | 34.54 |