The following pages link to Edge disjoint placement of graphs (Q754889):
Displaying 50 items.
- A list version of graph packing (Q284763) (← links)
- The Erdős-Sós conjecture for spiders of large size (Q393909) (← links)
- A note on \(k\)-placeable graphs (Q409394) (← links)
- A note on packing of graphic \(n\)-tuples (Q501040) (← links)
- Near packings of two graphs (Q512568) (← links)
- A sufficient degree condition for a graph to contain all trees of size \(k\) (Q546277) (← links)
- Partition of a bipartite graph into cycles (Q686183) (← links)
- The Turán number of sparse spanning graphs (Q744159) (← links)
- Subgraphs with triangular components (Q755595) (← 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)
- Packing of two digraphs into a transitive tournament (Q868371) (← links)
- Fixed-point-free embeddings of digraphs with small size (Q878623) (← links)
- Augmentation of covering arrays of strength two (Q897271) (← links)
- Packing of graphs with small product of sizes (Q958696) (← links)
- On a graph packing conjecture by Bollobás, Eldridge and Catlin (Q987545) (← links)
- Triangle packings and 1-factors in oriented graphs (Q1026012) (← links)
- Ore-type conditions implying 2-factors consisting of short cycles (Q1044946) (← links)
- Spanning cubic graph designs (Q1045074) (← links)
- Two theorems on packings of graphs (Q1090341) (← links)
- Degree sequences of random graphs (Q1146197) (← links)
- Symmetric edge-decompositions of hypercubes (Q1175554) (← links)
- An \(\Omega{} (n^{5/4})\) lower bound on the randomized complexity of graph properties (Q1180407) (← links)
- An \(\Omega{} (n^{4/3})\) lower bound on the randomized complexity of graph properties (Q1180414) (← links)
- On packing bipartite graphs (Q1200276) (← links)
- Embedding (p,p - 1) graphs in their complements (Q1247431) (← links)
- Packings of graphs and applications to computational complexity (Q1250227) (← links)
- Cycle factors in dense graphs (Q1292839) (← links)
- Optimal factorizations of families of trees (Q1301677) (← links)
- Mutual placement of bipartite graphs (Q1309454) (← links)
- Packing of partial designs (Q1323485) (← links)
- Embedding graphs of small size (Q1329826) (← links)
- A note on packing of three forests (Q1356715) (← links)
- Embedding digraphs of small size (Q1356787) (← links)
- Nonexistence of universal graphs without some trees (Q1385982) (← links)
- Packing of graphs and permutations -- a survey (Q1422441) (← links)
- Orthogonal double covers of general graphs. (Q1428558) (← links)
- A note on the ``packing of two copies of some trees into their third power'' (Q1431988) (← links)
- Packing graphs in their complements (Q1584285) (← links)
- Packing two graphs of even girth 10 (Q1689911) (← links)
- Rainbow spanning subgraphs in bounded edge-colourings of graphs with large minimum degree (Q1689912) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← 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 near packing of two graphs (Q1850487) (← links)
- Toughness, degrees and 2-factors (Q1887644) (← links)
- The complexity of cover graph recognition for some varieties of finite lattices (Q1908932) (← links)
- Packing three trees (Q1916129) (← links)
- 2-factors in dense graphs (Q1917480) (← links)
