Breaking graph symmetries by edge colourings
- 1 November 2017
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 127, 205-214
Abstract
No abstract availableAll Related Versions
This publication has 15 references indexed in Scilit:
- Bounds for Distinguishing Invariants of Infinite GraphsThe Electronic Journal of Combinatorics, 2017
- Distinguishing graphs with intermediate growthCombinatorica, 2015
- Distinguishing graphs by edge-colouringsEuropean Journal of Combinatorics, 2015
- The Distinguishing Index of Infinite GraphsThe Electronic Journal of Combinatorics, 2015
- Infinite motion and 2-distinguishability of graphs and groupsJournal of Algebraic Combinatorics, 2014
- Random Colourings and Automorphism Breaking in Locally Finite GraphsCombinatorics, Probability and Computing, 2013
- Distinguishing graphs with infinite motion and nonlinear growthArs Mathematica Contemporanea, 2013
- Distinguishing Infinite GraphsThe Electronic Journal of Combinatorics, 2007
- Symmetry Breaking in GraphsThe Electronic Journal of Combinatorics, 1996
- Zu einem Isomorphiesatz von H. Whitney f r GraphenMathematische Annalen, 1966