Every (p,p-2) graph is contained in its complement
From MaRDI portal
Publication:4154897
DOI10.1002/jgt.3190010308zbMath0375.05046OpenAlexW2097523783MaRDI QIDQ4154897
Publication date: 1977
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190010308
Related Items (31)
Embedding graphs of small size ⋮ Triple placement of graphs ⋮ A note on embedding graphs without short cycles ⋮ Two theorems on packings of graphs ⋮ A note on packing of three forests ⋮ Embedding digraphs of small size ⋮ Packing of two digraphs into a transitive tournament ⋮ Packing three trees ⋮ Fixed-point-free embeddings of digraphs with small size ⋮ Labeled embedding of \((n, n-2)\)-graphs in their complements ⋮ A note on \(k\)-placeable graphs ⋮ Near packings of graphs ⋮ Packing of graphs and permutations -- a survey ⋮ Packing a number of copies of a \(( p , q )\)-graph ⋮ A note on the ``packing of two copies of some trees into their third power ⋮ 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 ⋮ A note on an embedding problem in transitive tournaments ⋮ Embedding graphs in their complements ⋮ On self-complementary supergraphs of (\(n,n\))-graphs ⋮ A bibliography of graph equations ⋮ On embedding graphs with bounded sum of size and maximum degree ⋮ A note on a packing problem in transitive tournaments ⋮ Embedding (p,p - 1) graphs in their complements ⋮ Packing of graphs - a survey ⋮ 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
This page was built for publication: Every (p,p-2) graph is contained in its complement
