The distinguishing index of connected graphs without pendant edges
From MaRDI portal
Publication:4988841
DOI10.26493/1855-3974.1852.4f7zbMath1464.05152OpenAlexW3042784797MaRDI QIDQ4988841
Rafał Kalinowski, Mariusz Woźniak, Wilfried Imrich, Monika Pilśniak
Publication date: 19 May 2021
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/1855-3974.1852.4f7
Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Group actions on combinatorial structures (05E18)
Related Items (6)
Extremal graphs for the distinguishing index ⋮ Distinguishing arc-colourings of symmetric digraphs ⋮ Asymmetric edge-colorings of graphs with three colors ⋮ Edge-determining sets and determining index ⋮ Nordhaus-Gaddum type inequalities for the distinguishing index ⋮ Proper distinguishing arc-colourings of symmetric digraphs
Cites Work
- Distinguishing graphs by edge-colourings
- A bound for the distinguishing index of regular graphs
- The distinguishing index of infinite graphs
- Breaking graph symmetries by edge colourings
- Improving upper bounds for the distinguishing index
- An upper bound on the distinguishing index of graphs with minimum degree at least two
- The distinguishing index of the Cartesian product of finite graphs
- Unnamed Item
This page was built for publication: The distinguishing index of connected graphs without pendant edges