On a graph packing conjecture by Bollobás, Eldridge and Catlin
DOI10.1007/S00493-008-2278-0zbMATH Open1212.05132OpenAlexW2006001677WikidataQ123133273 ScholiaQ123133273MaRDI QIDQ987545FDOQ987545
Authors: Hemanshu Kaul, Gexin Yu, Alexandr 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
Recommendations
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Packings of graphs and applications to computational complexity
- Subgraphs of graphs. I
- Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer
- Edge disjoint placement of graphs
- Packing of graphs - a survey
- Embedding Arbitrary Graphs of Maximum Degree Two
- 2-factors in dense graphs
- A near packing of two graphs
- Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three
- Packing \(d\)-degenerate graphs
Cited In (22)
- An Ore-type analogue of the Sauer-Spencer theorem
- Extremal theorems for degree sequence packing and the two-color discrete tomography problem
- Proof of a Packing Conjecture of Bollobás
- A near packing of two graphs
- Toward Wojda's conjecture on digraph packing
- On a packing problem of Alon and Yuster
- A list version of graph packing
- A hypergraph version of a graph packing theorem by Bollobás and Eldridge
- On Two Conjectures on Packing of Graphs
- Sparse graphs of girth at least five are packable
- Packing \(d\)-degenerate graphs
- Ore-type graph packing problems
- On packing bipartite graphs
- Toward Żak's conjecture on graph packing
- Embedding Arbitrary Graphs of Maximum Degree Two
- Title not available (Why is that?)
- On the relation of separability, bandwidth and embedding
- Packing two graphs of even girth 10
- A note on packing of graphic \(n\)-tuples
- Efficient graph packing via game colouring
- Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer
- Packing graphs of bounded codegree
This page was built for publication: On a graph packing conjecture by Bollobás, Eldridge and Catlin
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987545)
