The following pages link to Subgraphs of graphs. I (Q1846887):
Displaying 27 items.
- An approximate version of the tree packing conjecture (Q273108) (← links)
- A list version of graph packing (Q284763) (← links)
- The Turán number of sparse spanning graphs (Q744159) (← links)
- Subgraphs with triangular components (Q755595) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- On a graph packing conjecture by Bollobás, Eldridge and Catlin (Q987545) (← links)
- Ore-type conditions implying 2-factors consisting of short cycles (Q1044946) (← links)
- Two theorems on packings of graphs (Q1090341) (← links)
- On the combinatorial problems which I would most like to see solved (Q1164626) (← links)
- An \(\Omega{} (n^{4/3})\) lower bound on the randomized complexity of graph properties (Q1180414) (← links)
- On packing bipartite graphs (Q1200276) (← links)
- Packing of partial designs (Q1323485) (← links)
- Packing bipartite graphs (Q1356720) (← links)
- Nonexistence of universal graphs without some trees (Q1385982) (← links)
- Packing two graphs of even girth 10 (Q1689911) (← links)
- Packing of graphs - a survey (Q1825885) (← links)
- A near packing of two graphs (Q1850487) (← links)
- Graphs containing every 2-factor (Q1926028) (← links)
- Typical and extremal aspects of friends-and-strangers graphs (Q2099406) (← links)
- Connectivity of friends-and-strangers graphs on random pairs (Q2111926) (← links)
- On the bipartite graph packing problem (Q2357142) (← links)
- An Ore-type analogue of the Sauer-Spencer theorem (Q2385133) (← links)
- Isoperimetric numbers of graphs (Q2639872) (← links)
- A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge (Q2853340) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Some results on placing bipartite graphs of maximum degree two (Q3439450) (← links)
- Embedding graphs in their complements (Q3936756) (← links)
