On deciding switching equivalence of graphs (Q1141663): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3916602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Colourings of Steiner Triple Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Graphs, Switching Classes and Euler Graphs are Equal in Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the n<sup>log n</sup> isomorphism technique (A Preliminary Report) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4121914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931443 / rank
 
Normal rank

Revision as of 05:28, 13 June 2024

scientific article
Language Label Description Also known as
English
On deciding switching equivalence of graphs
scientific article

    Statements

    On deciding switching equivalence of graphs (English)
    0 references
    0 references
    0 references
    1980
    0 references
    0 references
    switching equivalent graphs
    0 references
    isomorphism of graphs
    0 references