On a graph packing conjecture by Bollobás, Eldridge and Catlin
From MaRDI portal
Publication:987545
DOI10.1007/s00493-008-2278-0zbMath1212.05132OpenAlexW2006001677WikidataQ123133273 ScholiaQ123133273MaRDI QIDQ987545
Gexin Yu, Hemanshu Kaul, Alexandr V. Kostochka
Publication date: 13 August 2010
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-008-2278-0
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (5)
Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem ⋮ An Ore-type analogue of the Sauer-Spencer theorem ⋮ Packing two graphs of even girth 10 ⋮ On the relation of separability, bandwidth and embedding ⋮ Packing Graphs of Bounded Codegree
Cites Work
- Edge disjoint placement of graphs
- Packings of graphs and applications to computational complexity
- Packing of graphs - a survey
- Subgraphs of graphs. I
- A near packing of two graphs
- Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three
- 2-factors in dense graphs
- Packing \(d\)-degenerate graphs
- Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer
- Embedding Arbitrary Graphs of Maximum Degree Two
This page was built for publication: On a graph packing conjecture by Bollobás, Eldridge and Catlin
