Embedding (p,p - 1) graphs in their complements (Q1247431): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Packings of graphs and applications to computational complexity / 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: Edge disjoint placement of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fixed-point-free embeddings of graphs in their complements / rank | |||
Normal rank |
Latest revision as of 23:35, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Embedding (p,p - 1) graphs in their complements |
scientific article |
Statements
Embedding (p,p - 1) graphs in their complements (English)
0 references
1978
0 references