Pages that link to "Item:Q3936756"
From MaRDI portal
The following pages link to Embedding graphs in their complements (Q3936756):
Displaying 18 items.
- All trees are 1-embeddable and all except stars are 2-embeddable (Q687137) (← 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)
- On packing bipartite graphs (Q1200276) (← links)
- Embedding graphs of small size (Q1329826) (← links)
- Embedding digraphs of small size (Q1356787) (← links)
- Construction of self-complementary graphs (Q1377771) (← 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)
- A note on embedding graphs without short cycles (Q1883254) (← links)
- Packing three trees (Q1916129) (← links)
- Near packings of graphs (Q1953525) (← links)
- On embedding graphs with bounded sum of size and maximum degree (Q2017040) (← links)
- Labeled 2-packings of trees (Q2514165) (← links)
