Distinguishing threshold of graphs (Q6074586): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Number of distinguishing colorings and partitions / 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: The distinguishing number and distinguishing index of the lexicographic product of two graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymmetric trees with two prescribed degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distinguishing number of the hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distinguishing chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing partitions and asymmetric uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The group of an X-join of graphs / 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: Endomorphism breaking in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for distinguishing invariants of infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing Cartesian powers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of automorphism groups of Cayley graphs and maps. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms and regular embeddings of merged Johnson graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Graphs of Degree ≤ 6 and their Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing graphs by edge-colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing graphs by total colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE DISTINGUISHING NUMBERS OF MERGED JOHNSON GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing labellings of group action on vector spaces and graphs / 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: Q3424788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the asymptotic and computational complexity of graph distinguishability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing maps / rank
 
Normal rank

Latest revision as of 04:09, 3 August 2024

scientific article; zbMATH DE number 7749417
Language Label Description Also known as
English
Distinguishing threshold of graphs
scientific article; zbMATH DE number 7749417

    Statements

    Distinguishing threshold of graphs (English)
    0 references
    0 references
    0 references
    12 October 2023
    0 references
    distinguishing coloring
    0 references
    distinguishing threshold
    0 references
    generalized Johnson graphs
    0 references
    symmetry breaking
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references