On self-complementary supergraphs of (\(n,n\))-graphs (Q1773368): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On self‐complementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every (p,p-2) graph is contained in its complement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding (p,p - 1) graphs in their complements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs self-complementary in \(K_ n-e\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3936756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-complementary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selbstkomplementäre Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5730676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge disjoint placement of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding graphs of small size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4340018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3715121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing of graphs - a survey / rank
 
Normal rank

Latest revision as of 10:37, 10 June 2024

scientific article
Language Label Description Also known as
English
On self-complementary supergraphs of (\(n,n\))-graphs
scientific article

    Statements

    On self-complementary supergraphs of (\(n,n\))-graphs (English)
    0 references
    0 references
    0 references
    0 references
    28 April 2005
    0 references
    0 references
    Embedding of graphs
    0 references
    Self-complementary graphs
    0 references
    0 references