Embedding graphs in their complements

DOI10.21136/cmj.1981.101722zbMath0479.05028OpenAlexW3048281425MaRDI QIDQ3936756

Ralph J. Faudree, Richard H. Schelp, Cecil C. Rousseau, Seymour Schuster

Publication date: 1981

Full work available at URL: https://eudml.org/doc/13238

zbMATH Keywords

graph embedding

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (19)

Embedding graphs of small size ⋮ A note on embedding graphs without short cycles ⋮ Two theorems on packings of graphs ⋮ Embedding digraphs of small size ⋮ Packing three trees ⋮ Construction of self-complementary graphs ⋮ Fixed-point-free embeddings of digraphs with small size ⋮ Near packings of graphs ⋮ Packing of graphs and permutations -- a survey ⋮ 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 ⋮ 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 of graphs - a survey ⋮ Unnamed Item ⋮ Packing graphs in their complements ⋮ Packing two graphs of order n having total size at most 2n-2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge disjoint placement of graphs
• Embedding (p,p - 1) graphs in their complements
• Packings of graphs and applications to computational complexity
• Subgraphs of graphs. I
• Every (p,p-2) graph is contained in its complement

This page was built for publication: Embedding graphs in their complements