Edge-distinguishing of star-free graphs

DOI10.37236/8882zbMath1445.05048OpenAlexW3081717843MaRDI QIDQ785585

Ernest Kargul, Katarzyna Pal, Aleksandra Gorzkowska, Szymon Musiał

Publication date: 7 August 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.37236/8882

zbMATH Keywords

claw-free graphplanar graphedge colouringdistinguishing indexsymmetry breaking in graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Ordinal and cardinal numbers (03E10)

Related Items (2)

Extremal graphs for the distinguishing index ⋮ Asymmetric edge-colorings of graphs with three colors

Cites Work

• Distinguishing graphs by edge-colourings
• A strengthening of Ben Rebea's lemma
• Claw-free graphs---a survey
• Symmetry breaking in graphs
• Graph Theory

This page was built for publication: Edge-distinguishing of star-free graphs