On asymmetric colourings of claw-free graphs
From MaRDI portal
Publication:2048557
DOI10.37236/8886zbMath1470.05059OpenAlexW3185033389MaRDI QIDQ2048557
Wilfried Imrich, Rafał Kalinowski, Mariusz Woźniak, Monika Pilśniak
Publication date: 6 August 2021
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.37236/8886
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
Cites Work
- Nordhaus-Gaddum theorem for the distinguishing chromatic number
- Distinguishing graphs by edge-colourings
- Distinguishing maps
- On symmetries of edge and vertex colourings of graphs
- Regular orbits of permutation groups on the power set
- A note on the asymptotic and computational complexity of graph distinguishability
- Symmetry breaking in graphs
- Asymmetrizing trees of maximum valence \(2^{\aleph_0}\)
- Distinguishing graphs of maximum valence 3
- Distinguishing infinite graphs
- Breaking graph symmetries by edge colourings
- Distinguishing labellings of group action on vector spaces and graphs
- Zu einem Isomorphiesatz von H. Whitney für Graphen
- The distinguishing index of the Cartesian product of countable graphs
- Improving upper bounds for the distinguishing index
- Distinguishing numbers of finite 4-valent vertex-transitive graphs
- The optimal general upper bound for the distinguishing index of infinite graphs
This page was built for publication: On asymmetric colourings of claw-free graphs
