Asymmetric edge-colorings of graphs with three colors

DOI10.1016/j.ejc.2022.103526zbMath1497.05083OpenAlexW4284887997MaRDI QIDQ2674556

Grech, Mariusz, Andrzej P. Kisielewicz

Publication date: 14 September 2022

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2022.103526

zbMATH Keywords

edge-coloringdistinguishing indexdistinguishing coloringautomorphism group of a graphasymmetric coloring

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Group actions on combinatorial structures (05E18)

Cites Work

• Distinguishing graphs by edge-colourings
• Edge-distinguishing of star-free graphs
• Symmetry breaking in graphs
• Distinguishing index of maps
• Corrigendum to: ``A bound for the distinguishing index of regular graphs
• A bound for the distinguishing index of regular graphs
• Distinguishing index of graphs with simple automorphism groups
• Breaking graph symmetries by edge colourings
• Nordhaus-Gaddum type inequalities for the distinguishing index
• Asymmetric trees with two prescribed degrees
• The distinguishing index of the Cartesian product of countable graphs
• Improving upper bounds for the distinguishing index
• The distinguishing index of connected graphs without pendant edges
• The optimal general upper bound for the distinguishing index of infinite graphs
• The distinguishing number and the distinguishing index of line and graphoidal graph(s)
• The distinguishing index of the Cartesian product of finite graphs

This page was built for publication: Asymmetric edge-colorings of graphs with three colors