A note on breaking small automorphisms in graphs
Authors:
- Rafał KalinowskiRKRafał Kalinowski
- Monika PilśniakMPMonika Pilśniak
- Mariusz WoźniakMWMariusz Woźniak
- 1 December 2017
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 232, 221-225
Abstract
No abstract availableFunding Information
- Ministerstwo Nauki i Szkolnictwa Wyższego (DEC- 2013/09/B/ST1/01772)
- Narodowe Centrum Nauki (DEC- 2013/09/B/ST1/01772)
This publication has 9 references indexed in Scilit:
- Improving upper bounds for the distinguishing indexArs Mathematica Contemporanea, 2017
- Distinguishing graphs by total colouringsArs Mathematica Contemporanea, 2015
- Distinguishing graphs by edge-colouringsEuropean Journal of Combinatorics, 2015
- How to personalize the vertices of a graph?European Journal of Combinatorics, 2014
- A New Upper Bound for the Irregularity Strength of GraphsSIAM Journal on Discrete Mathematics, 2011
- Titelei/Inhaltsverzeichnis2009
- Vertex colouring edge partitionsJournal of Combinatorial Theory, Series B, 2005
- Edge weights and vertex coloursJournal of Combinatorial Theory, Series B, 2004
- Symmetry Breaking in GraphsThe Electronic Journal of Combinatorics, 1996