Extremal graphs for the distinguishing index
From MaRDI portal
Publication:2142642
DOI10.1016/j.disc.2022.112905zbMath1490.05075OpenAlexW4226462389MaRDI QIDQ2142642
Rafał Kalinowski, Monika Pilśniak
Publication date: 27 May 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2022.112905
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Stability in the Erdős-Gallai theorems on cycles and paths
- Improved degree conditions for Hamiltonian properties
- Distinguishing graphs by edge-colourings
- On symmetries of edge and vertex colourings of graphs
- Edge-distinguishing of star-free graphs
- Dense arbitrarily partitionable graphs
- Distinguishing index of maps
- Trees with distinguishing index equal distinguishing number plus one
- Distinguishing numbers and distinguishing indices of oriented graphs
- Breaking graph symmetries by edge colourings
- On maximal paths and circuits of graphs
- Maximal circuits of graphs. I
- Improving upper bounds for the distinguishing index
- The distinguishing index of connected graphs without pendant edges