Graphs self-complementary in \(K_ n-e\)

DOI10.1016/0012-365X(90)90062-MzbMath0739.05063MaRDI QIDQ1813737

C. R. J. Clapham

Publication date: 25 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

self-complementarycomplementing permutation

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Cyclic partitions of complete and almost complete uniform hypergraphs ⋮ The existence of bipartite almost self-complementary 3-uniform hypergraphs ⋮ Almost self-complementary uniform hypergraphs ⋮ Packing of graphs and permutations -- a survey ⋮ Almost self-complementary 3-uniform hypergraphs ⋮ -partite self-complementary and almost self-complementary -uniform hypergraphs ⋮ Almost \(t\)-complementary uniform hypergraphs ⋮ On self-complementary supergraphs of (\(n,n\))-graphs ⋮ Steiner almost self-complementary graphs and halving near-Steiner triple systems ⋮ The complete graph \(t\)-packings and \(t\)-coverings

Cites Work

• Unnamed Item
• The partial complement of graphs
• Selbstkomplementäre Graphen
• A graph and its complement with specified properties V: The self‐complement index