Every (p,p-2) graph is contained in its complement
From MaRDI portal
(Redirected from Publication:4154897)
Cited in
(34)- Packing of graphs and permutations -- a survey
- All trees are 1-embeddable and all except stars are 2-embeddable
- A note on an embedding problem in transitive tournaments
- Packing a number of copies of a \(( p , q )\)-graph
- Labeled packing of non star trees into their \(k\) th power, \(k\geq 5\)
- A note on k-placeable graphs
- Embedding (p,p - 1) graphs in their complements
- A note on embedding graphs without short cycles
- Near packings with restriction on degrees in graphs
- Labeled embedding of \((n, n-2)\)-graphs in their complements
- On embedding graphs with bounded sum of size and maximum degree
- Packing three copies of a tree into its sixth power
- Symmetric edge-decompositions of hypercubes
- Sparse graphs of girth at least five are packable
- Packing of two digraphs into a transitive tournament
- On packing bipartite graphs
- Fixed-point-free embeddings of digraphs with small size
- A note on a packing problem in transitive tournaments
- Embedding graphs of small size
- Embedding digraphs of small size
- Packing graphs in their complements
- Packing of graphs - a survey
- Embedding graphs in their complements
- A note on packing two copies of a tree into a graph with small maximum degree
- A note on packing of three forests
- On uniqueness of packing of three copies of 2-factors
- A note on the ``packing of two copies of some trees into their third power
- A bibliography of graph equations
- Near packings of graphs
- On self-complementary supergraphs of (n,n)-graphs
- Packing two graphs of order n having total size at most 2n-2
- Triple placement of graphs
- Packing three trees
- Two theorems on packings of graphs
This page was built for publication: Every (p,p-2) graph is contained in its complement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4154897)
