A note on breaking small automorphisms in graphs
From MaRDI portal
Publication:2410241
DOI10.1016/j.dam.2017.07.034zbMath1372.05075OpenAlexW2751387104MaRDI QIDQ2410241
Monika Pilśniak, Rafał Kalinowski, Mariusz Woźniak
Publication date: 17 October 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.07.034
1-2-3 conjecture1-2 conjecturedistinguishing indexsymmetry breaking in graphstotal distinguishing index
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Unnamed Item
- How to personalize the vertices of a graph?
- Distinguishing graphs by edge-colourings
- Edge weights and vertex colours
- Symmetry breaking in graphs
- Vertex colouring edge partitions
- Distinguishing graphs by total colourings
- A New Upper Bound for the Irregularity Strength of Graphs
- Improving upper bounds for the distinguishing index