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

DOI10.1007/BF02761996MaRDI QIDQ1247431zbMATH OpenFDO

Authors David Burns, Seymour Schuster

Publication date 1978

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

Full work available at URL https://doi.org/10.1007/BF02761996

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(23)

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

This page was built for publication: Embedding (p,p - 1) graphs in their complements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1247431)