On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture (Q2026341): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Distinguishing Cartesian powers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using determining sets to distinguish Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry breaking in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distinguishing number of the hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing number and adjacency properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying graph automorphisms using determining sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cost of 2-distinguishing Cartesian powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5298911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the distinguishing numbers of trees and forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Destroying automorphisms by fixing nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing Cartesian products of countable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing colorings of Cartesian products of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trivial Set-Stabilizers in Finite Permutation Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distinguishing number of Cartesian products of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing Cartesian powers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cartesian powers of graphs can be distinguished by two labels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing number of countable homogeneous relational structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite factors of Bernoulli schemes and distinguishing labelings of directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry breaking in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another proof of Gluck's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the distinguishing number of infinite graphs and permutation groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishability of locally finite trees / rank
 
Normal rank

Latest revision as of 18:55, 25 July 2024

scientific article
Language Label Description Also known as
English
On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture
scientific article

    Statements

    On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture (English)
    0 references
    0 references
    0 references
    19 May 2021
    0 references
    distinguishing number
    0 references
    automorphism group
    0 references
    cyclic tournament
    0 references
    Albertson-Collins conjecture
    0 references
    0 references
    0 references

    Identifiers