The following pages link to Embedding graphs of small size (Q1329826):
Displaying 18 items.
- Fixed-point-free embeddings of digraphs with small size (Q878623) (← links)
- The complete graph \(t\)-packings and \(t\)-coverings (Q1313352) (← links)
- Embedding digraphs of small size (Q1356787) (← links)
- Packing of graphs and permutations -- a survey (Q1422441) (← links)
- On self-complementary supergraphs of (\(n,n\))-graphs (Q1773368) (← links)
- Packing three trees (Q1916129) (← links)
- On embedding graphs with bounded sum of size and maximum degree (Q2017040) (← links)
- Labeled embedding of \((n, n-2)\)-graphs in their complements (Q2409792) (← links)
- (Q2753952) (← links)
- Graph labellings in Boolean lattices (Q2760983) (← links)
- A note on uniquely embeddable forests (Q2866461) (← links)
- (Q3023886) (← links)
- Immersing small complete graphs (Q3085021) (← links)
- Characterizing Graphs of Small Carving-Width (Q3167377) (← links)
- Embedding spanning subgraphs of small bandwidth (Q3503507) (← links)
- A note on uniquely embeddable graphs (Q4222377) (← links)
- On cyclically embeddable (n,n)-graphs (Q4458972) (← links)
- Labeled packing of non star trees into their \(k\) th power, \(k\geq 5\) (Q6562431) (← links)
