The distinguishing index of graphs with infinite minimum degree (Q6142658): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Symmetry breaking in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cover-index of infinite 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 index of infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distinguishing index of the Cartesian product of countable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4053701 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing graphs by edge-colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking graph symmetries by edge colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound for the distinguishing index of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On symmetries of edge and vertex colourings of graphs / rank
 
Normal rank

Revision as of 09:27, 22 August 2024

scientific article; zbMATH DE number 7783192
Language Label Description Also known as
English
The distinguishing index of graphs with infinite minimum degree
scientific article; zbMATH DE number 7783192

    Statements

    The distinguishing index of graphs with infinite minimum degree (English)
    0 references
    0 references
    0 references
    4 January 2024
    0 references
    distinguishing colorings
    0 references
    distinguishing index
    0 references
    infinite graphs
    0 references
    regular graphs
    0 references

    Identifiers

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