Pages that link to "Item:Q1247431"
From MaRDI portal
The following pages link to Embedding (p,p - 1) graphs in their complements (Q1247431):
Displaying 21 items.
- All trees are 1-embeddable and all except stars are 2-embeddable (Q687137) (← links)
- A note on packing two copies of a tree into a graph with small maximum degree (Q785787) (← links)
- Packing two graphs of order n having total size at most 2n-2 (Q803166) (← links)
- Fixed-point-free embeddings of digraphs with small size (Q878623) (← links)
- Two theorems on packings of graphs (Q1090341) (← links)
- Symmetric edge-decompositions of hypercubes (Q1175554) (← links)
- On packing bipartite graphs (Q1200276) (← links)
- Embedding digraphs of small size (Q1356787) (← links)
- Packing of graphs and permutations -- a survey (Q1422441) (← links)
- Packing graphs in their complements (Q1584285) (← links)
- Sparse graphs of girth at least five are packable (Q1759402) (← links)
- On self-complementary supergraphs of (\(n,n\))-graphs (Q1773368) (← links)
- Packing of graphs - a survey (Q1825885) (← links)
- On embedding graphs with bounded sum of size and maximum degree (Q2017040) (← links)
- Packing trees in complete bipartite graphs (Q2062685) (← links)
- Packing a number of copies of a \(( p , q )\)-graph (Q2217483) (← links)
- Packing three copies of a tree into its sixth power (Q2243090) (← links)
- Triple placement of graphs (Q2366221) (← links)
- Labeled 2-packings of trees (Q2514165) (← links)
- Packing two copies of a sparse graph into a graph with restrained maximum degree (Q3652549) (← links)
- Embedding graphs in their complements (Q3936756) (← links)