Automorphisms and distinguishing numbers of geometric cliques (Q938315): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
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: Distinguishing geometric 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: The distinguishing number of the hypercube / 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 distinguishing number of the direct product and wreath product action. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum distinguishing number of a group / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distinguishing chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing Cartesian powers of 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: Cartesian powers of graphs can be distinguished by two labels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Theory of Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing numbers for graphs and groups / rank
 
Normal rank

Revision as of 13:52, 28 June 2024

scientific article
Language Label Description Also known as
English
Automorphisms and distinguishing numbers of geometric cliques
scientific article

    Statements

    Identifiers