Pages that link to "Item:Q1878591"
From MaRDI portal
The following pages link to Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three (Q1878591):
Displaying 19 items.
- Spanning 3-colourable subgraphs of small bandwidth in dense graphs (Q933679) (← links)
- Proof of the bandwidth conjecture of Bollobás and Komlós (Q957895) (← 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)
- Packing two graphs of even girth 10 (Q1689911) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
- Graphs containing every 2-factor (Q1926028) (← links)
- Packing a number of copies of a \(( p , q )\)-graph (Q2217483) (← links)
- On the relation of separability, bandwidth and embedding (Q2287746) (← links)
- Packing \(d\)-degenerate graphs (Q2464154) (← 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)
- A Dirac-Type Result on Hamilton Cycles in Oriented Graphs (Q3529511) (← links)
- Embedding Arbitrary Graphs of Maximum Degree Two (Q4289355) (← links)
- Packing Graphs of Bounded Codegree (Q4962588) (← links)
- On the Bollobás–Eldridge Conjecture for Bipartite Graphs (Q5443799) (← links)
- Disproof of a Conjecture of Erdős and Simonovits on the Turán Number of Graphs with Minimum Degree 3 (Q6101105) (← links)
- A robust Corrádi-Hajnal theorem (Q6641058) (← links)
