The following pages link to Edge disjoint placement of graphs (Q754889):
Displaying 45 items.
- Graphs containing every 2-factor (Q1926028) (← links)
- Near packings of graphs (Q1953525) (← links)
- On embedding graphs with bounded sum of size and maximum degree (Q2017040) (← links)
- Typical and extremal aspects of friends-and-strangers graphs (Q2099406) (← links)
- Connectivity of friends-and-strangers graphs on random pairs (Q2111926) (← links)
- Labeled packing of cycles and circuits (Q2118238) (← links)
- A note on packing of uniform hypergraphs (Q2158207) (← links)
- Disjoint directed cycles in directed graphs (Q2185930) (← 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)
- Ramsey-goodness -- and otherwise (Q2259367) (← links)
- On the bipartite graph packing problem (Q2357142) (← links)
- Triple placement of graphs (Q2366221) (← links)
- An Ore-type analogue of the Sauer-Spencer theorem (Q2385133) (← links)
- Labeled embedding of \((n, n-2)\)-graphs in their complements (Q2409792) (← links)
- Packing \(d\)-degenerate graphs (Q2464154) (← links)
- Labeled 2-packings of trees (Q2514165) (← links)
- On a packing problem of Alon and Yuster (Q2629291) (← links)
- Isoperimetric numbers of graphs (Q2639872) (← links)
- Disjoint directed cycles with specified lengths in directed bipartite graphs (Q2659188) (← links)
- Embedding of graphs in two-irregular graphs (Q2707975) (← links)
- A hypergraph version of a graph packing theorem by Bollobás and Eldridge (Q2853340) (← links)
- Packing of graphic \(n\)-tuples (Q2888877) (← links)
- Embedding Graphs Having Ore-Degree at Most Five (Q3119788) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem (Q3449866) (← links)
- Efficient Graph Packing via Game Colouring (Q3552503) (← links)
- Hypergraph Packing and Sparse Bipartite Ramsey Numbers (Q3557517) (← links)
- Packing two copies of a sparse graph into a graph with restrained maximum degree (Q3652549) (← links)
- Embedding graphs in their complements (Q3936756) (← links)
- On graphs with linear Ramsey numbers (Q4521487) (← links)
- (Q4622612) (← links)
- Proof of a Packing Conjecture of Bollobás (Q4862745) (← links)
- Packing Graphs of Bounded Codegree (Q4962588) (← links)
- Partial Degree Conditions and Cycle Coverings (Q4982290) (← links)
- Packing Trees into 1-planar Graphs (Q5084698) (← links)
- On the Bollobás–Eldridge Conjecture for Bipartite Graphs (Q5443799) (← links)
- The Ramsey number of the clique and the hypercube (Q5494398) (← links)
- On the elusiveness of Hamiltonian property (Q5931908) (← links)
- k-Planar Placement and Packing of Δ-Regular Caterpillars (Q6066468) (← links)
- Labeled packing of non star trees into their \(k\) th power, \(k\geq 5\) (Q6562431) (← links)
- Partial degrees on matchings for cycles in bipartite graphs (Q6570058) (← links)
- On the diameters of friends-and-strangers graphs (Q6615519) (← links)
- Flip colouring of graphs (Q6632145) (← links)
- On uniqueness of packing of three copies of 2-factors (Q6667292) (← links)
