Distinguishing graphs by edge-colourings
From MaRDI portal
Publication:482130
DOI10.1016/j.ejc.2014.11.003zbMath1304.05046OpenAlexW2072754781MaRDI QIDQ482130
Rafał Kalinowski, Monika Pilśniak
Publication date: 19 December 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2014.11.003
Related Items (41)
The role of the Axiom of Choice in proper and distinguishing colourings ⋮ Bounds for distinguishing invariants of infinite graphs ⋮ An upper bound on the distinguishing index of graphs with minimum degree at least two ⋮ Extremal graphs for the distinguishing index ⋮ Distinguishing arc-colourings of symmetric digraphs ⋮ Number of colors needed to break symmetries of a graph by an arbitrary edge coloring ⋮ Equitable distinguishing chromatic number ⋮ The distinguishing number and the distinguishing index of graphs from primary subgraphs ⋮ The distinguishing number and distinguishing index of the lexicographic product of two graphs ⋮ The distinguishing number (index) and the domination number of a graph ⋮ Distinguishing number and distinguishing index of strong product of two graphs ⋮ Trees with distinguishing index equal distinguishing number plus one ⋮ Breaking graph symmetries by edge colourings ⋮ A note on breaking small automorphisms in graphs ⋮ Asymmetric edge-colorings of graphs with three colors ⋮ Distinguishing threshold of graphs ⋮ The distinguishing index of graphs with infinite minimum degree ⋮ Distinguishing numbers and distinguishing indices of oriented graphs ⋮ A bound for the distinguishing index of regular graphs ⋮ Improving upper bounds for the distinguishing index ⋮ Unnamed Item ⋮ Symmetry breaking in planar and maximal outerplanar graphs ⋮ Distinguishing index of graphs with simple automorphism groups ⋮ The distinguishing number and the distinguishing index of line and graphoidal graph(s) ⋮ The chromatic distinguishing index of certain graphs ⋮ Edge motion and the distinguishing index ⋮ Distinguishing index of maps ⋮ Distinguishing graphs of maximum valence 3 ⋮ Distinguishing index of Kronecker product of two graphs ⋮ On asymmetric colourings of claw-free graphs ⋮ Nordhaus-Gaddum type inequalities for the distinguishing index ⋮ The distinguishing index of connected graphs without pendant edges ⋮ On symmetries of edge and vertex colourings of graphs ⋮ Number of distinguishing colorings and partitions ⋮ Proper distinguishing arc-colourings of symmetric digraphs ⋮ Edge-distinguishing of star-free graphs ⋮ On the distinguishing number of functigraphs ⋮ The distinguishing index of infinite graphs ⋮ Distinguishing number and distinguishing index of neighbourhood corona of two graphs ⋮ Distinguishing number and distinguishing index of certain graphs ⋮ Precise bounds for the distinguishing index of the Cartesian product
Cites Work
- Nordhaus-Gaddum theorem for the distinguishing chromatic number
- How to personalize the vertices of a graph?
- Endomorphism breaking in graphs
- Distinguishability of infinite groups and graphs
- On computing the distinguishing numbers of trees and forests
- The distinguishing chromatic number
- Symmetry breaking in graphs
- Bounds on the distinguishing chromatic number
- The distinguishing number of Cartesian products of complete graphs
- Distinguishing labellings of group action on vector spaces and graphs
- Distinguishing Chromatic Number of Cartesian Products of Graphs
- Motion and distinguishing number two
- On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach
- Asymmetric graphs
This page was built for publication: Distinguishing graphs by edge-colourings
