On a graph packing conjecture by Bollobás, Eldridge and Catlin

DOI10.1007/S00493-008-2278-0MaRDI QIDQ987545zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

graph packing

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Packing graphs of bounded codegree
• Packing two graphs of even girth 10
• Packing \(d\)-degenerate graphs
• On Packing Two Graphs with Bounded Sum of Sizes and Maximum Degree
• A near packing of two graphs

Cites work

• 2-factors in dense graphs
• A near packing of two graphs
• Edge disjoint placement of graphs
• Embedding Arbitrary Graphs of Maximum Degree Two
• Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer
• Packing \(d\)-degenerate graphs
• Packing of graphs - a survey
• Packings of graphs and applications to computational complexity
• Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three
• Subgraphs of graphs. I

Cited in

(22)

• Packing graphs of bounded codegree
• 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
• On a packing problem of Alon and Yuster
• Toward Wojda's conjecture on digraph packing
• A list version of graph packing
• A hypergraph version of a graph packing theorem by Bollobás and Eldridge
• Sparse graphs of girth at least five are packable
• Packing \(d\)-degenerate graphs
• On Two Conjectures on Packing of Graphs
• Ore-type graph packing problems
• On packing bipartite graphs
• Toward Żak's conjecture on graph packing
• Embedding Arbitrary Graphs of Maximum Degree Two
• scientific article; zbMATH DE number 6381752 (Why is no real title available?)
• 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

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)