Embedding (p,p - 1) graphs in their complements

DOI10.1007/BF02761996zbMath0379.05023MaRDI QIDQ1247431

Seymour Schuster, David Burns

Publication date: 1978

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99)

Related Items

Triple placement of graphs ⋮ Two theorems on packings of graphs ⋮ Embedding digraphs of small size ⋮ Fixed-point-free embeddings of digraphs with small size ⋮ Packing of graphs and permutations -- a survey ⋮ Packing a number of copies of a \(( p , q )\)-graph ⋮ Symmetric edge-decompositions of hypercubes ⋮ Packing three copies of a tree into its sixth power ⋮ All trees are 1-embeddable and all except stars are 2-embeddable ⋮ On packing bipartite graphs ⋮ Sparse graphs of girth at least five are packable ⋮ Embedding graphs in their complements ⋮ On self-complementary supergraphs of (\(n,n\))-graphs ⋮ On embedding graphs with bounded sum of size and maximum degree ⋮ Labeled 2-packings of trees ⋮ Packing trees in complete bipartite graphs ⋮ Packing of graphs - a survey ⋮ Packing two copies of a sparse graph into a graph with restrained maximum degree ⋮ A note on packing two copies of a tree into a graph with small maximum degree ⋮ Packing graphs in their complements ⋮ Packing two graphs of order n having total size at most 2n-2

Cites Work

• Edge disjoint placement of graphs
• Packings of graphs and applications to computational complexity
• Fixed-point-free embeddings of graphs in their complements
• Every (p,p-2) graph is contained in its complement