Distinguishing graphs by edge-colourings
Authors:
- Rafał KalinowskiRKRafał Kalinowski
- Monika PilśniakMPMonika Pilśniak
- 1 April 2015
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 45, 124-131
Abstract
No abstract availableFunding Information
- Polish Ministry of Science and Higher Education
This publication has 14 references indexed in Scilit:
- Nordhaus-Gaddum Theorem for the Distinguishing Chromatic NumberThe Electronic Journal of Combinatorics, 2013
- Motion and distinguishing number twoArs Mathematica Contemporanea, 2011
- Distinguishing Chromatic Number of Cartesian Products of GraphsSIAM Journal on Discrete Mathematics, 2010
- Bounds on the Distinguishing Chromatic NumberThe Electronic Journal of Combinatorics, 2009
- The distinguishing number of Cartesian products of complete graphsEuropean Journal of Combinatorics, 2008
- On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting ApproachSIAM Journal on Discrete Mathematics, 2008
- On Computing the Distinguishing Numbers of Trees and ForestsThe Electronic Journal of Combinatorics, 2006
- The Distinguishing Chromatic NumberThe Electronic Journal of Combinatorics, 2006
- Symmetry Breaking in GraphsThe Electronic Journal of Combinatorics, 1996
- Asymmetric graphsActa Mathematica Hungarica, 1963