Pages that link to "Item:Q1250227"
From MaRDI portal
The following pages link to Packings of graphs and applications to computational complexity (Q1250227):
Displaying 50 items.
- An approximate version of the tree packing conjecture (Q273108) (← links)
- 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)
- Near packings of two graphs (Q512568) (← links)
- The Turán number of sparse spanning graphs (Q744159) (← 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)
- Packing of graphs with small product of sizes (Q958696) (← 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)
- Packing trees in complete graphs (Q1101132) (← links)
- Symmetric edge-decompositions of hypercubes (Q1175554) (← links)
- Some results on the complexity of families of sets (Q1176725) (← links)
- On packing bipartite graphs (Q1200276) (← links)
- Embedding (p,p - 1) graphs in their complements (Q1247431) (← links)
- Packing of partial designs (Q1323485) (← links)
- Embedding digraphs of small size (Q1356787) (← 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)
- Packing of graphs - a survey (Q1825885) (← links)
- A near packing of two graphs (Q1850487) (← links)
- 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)
- Labeled packing of cycles and circuits (Q2118238) (← links)
- A note on packing of uniform hypergraphs (Q2158207) (← links)
- Packing a number of copies of a \(( p , q )\)-graph (Q2217483) (← links)
- On the relation of separability, bandwidth and embedding (Q2287746) (← 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)
- The threshold bias of the clique-factor game (Q2664555) (← links)
- A hypergraph version of a graph packing theorem by Bollobás and Eldridge (Q2853340) (← links)
- On Degree Sequences Forcing The Square of a Hamilton Cycle (Q2968516) (← 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)
- Almost regular edge colorings and regular decompositions of complete graphs (Q3614746) (← links)
- Packing two copies of a sparse graph into a graph with restrained maximum degree (Q3652549) (← links)
- Embedding graphs in their complements (Q3936756) (← links)
