Asymmetric edge-colorings of graphs with three colors

DOI10.1016/J.EJC.2022.103526MaRDI QIDQ2674556zbMATH OpenOpenAlexFDO

Authors Mariusz Grech, Andrzej 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

asymmetric coloringautomorphism group of a graphdistinguishing coloringdistinguishing indexedge-coloring

Mathematics Subject Classification ID

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

Recommendations

• Asymmetric 2-colorings of graphs
• A bound for the distinguishing index of regular graphs
• Asymmetric colorings of products of graphs and digraphs
• On asymmetric colourings of claw-free graphs
• Asymmetric two-colourings of graphs in S³

Cites work

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

Cited in

(6)

• On asymmetric colourings of claw-free graphs
• Asymmetric two-colourings of graphs in S³
• Asymmetric 2-colorings of graphs
• Asymmetric colouring of locally compact permutation groups
• Minimal asymmetric hypergraphs
• A note on asymmetric hypergraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2674556)