Embedding graphs in their complements
From MaRDI portal
Cites work
- Edge disjoint placement of graphs
- Embedding (p,p - 1) graphs in their complements
- Every (p,p-2) graph is contained in its complement
- scientific article; zbMATH DE number 3675941 (Why is no real title available?)
- scientific article; zbMATH DE number 3312524 (Why is no real title available?)
- scientific article; zbMATH DE number 3377257 (Why is no real title available?)
- Packings of graphs and applications to computational complexity
- Subgraphs of graphs. I
Cited in
(23)- Two theorems on packings of graphs
- On packing bipartite graphs
- Embedding graphs of small size
- Embedding digraphs of small size
- Construction of self-complementary graphs
- 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
- A note on embedding graphs without short cycles
- Packing three trees
- Near packings of graphs
- On embedding graphs with bounded sum of size and maximum degree
- Labeled 2-packings of trees
- Bipacking a bipartite graph with girth at least 12
- Labeled packing of non star trees into their \(k\) th power, \(k\geq 5\)
- Unstable graphs and packing into fifth power
- Proof of a packing conjecture of bipartite graphs
- All trees are 1-embeddable and all except stars are 2-embeddable
- Near packings with restriction on degrees in graphs
- 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 graphs in their complements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3936756)
