The number of open chains of length three and the parity of the number of open chains of length k in self-complementary graphs (Q1135293): Difference between revisions

From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710401496743
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4097320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian arcs in self-complementary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potentially self-complementary degree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3956991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the Hamiltonian problem for self-complementary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selbstkomplementäre Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5730676 / rank
 
Normal rank

Revision as of 04:04, 13 June 2024

scientific article
Language Label Description Also known as
English
The number of open chains of length three and the parity of the number of open chains of length k in self-complementary graphs
scientific article

    Statements

    The number of open chains of length three and the parity of the number of open chains of length k in self-complementary graphs (English)
    0 references
    1979
    0 references
    open chains of length three
    0 references
    self-complementary graphs
    0 references

    Identifiers