Distinguishing tournaments with small label classes
From MaRDI portal
Publication:6621241
Publication date: 18 October 2024
Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)
Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Another proof of Gluck's theorem
- Symmetry breaking in graphs
- Symmetry breaking in tournaments
- The cost of 2-distinguishing Cartesian powers
- The distinguishing number of the augmented cube and hypercube powers
- Distinguishing graphs by total colourings
- The distinguishing index of the Cartesian product of countable graphs
- Improving upper bounds for the distinguishing index
- Trivial Set-Stabilizers in Finite Permutation Groups
- Small label classes in 2-distinguishing labelings
This page was built for publication: Distinguishing tournaments with small label classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621241)
