A near packing of two graphs

DOI10.1006/JCTB.2000.1971zbMATH Open1029.05122OpenAlexW2054349075MaRDI QIDQ1850487FDOQ1850487

Nancy Eaton

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2000.1971

Recommendations

• Near packings of two graphs
• On Packing Two Graphs with Bounded Sum of Sizes and Maximum Degree
• On a graph packing conjecture by Bollobás, Eldridge and Catlin
• Near packings of graphs
• Packing graphs of bounded codegree

Mathematics Subject Classification ID

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
• Edge disjoint placement of graphs
• Packing of graphs - a survey
• 2-factors in dense graphs
• Packing two forests into a bipartite graph
• Packing of three copies of a graph

Cited In (13)

• Packing of graphs with small product of sizes
• An Ore-type analogue of the Sauer-Spencer theorem
• On Packing Two Graphs with Bounded Sum of Sizes and Maximum Degree
• A note on careful packing of a graph
• Packing \(d\)-degenerate graphs
• Ore-type graph packing problems
• On a graph packing conjecture by Bollobás, Eldridge and Catlin
• Packing Graphs of Bounded Codegree
• Packing two graphs of even girth 10
• Efficient graph packing via game colouring
• Near packings of graphs
• Near packings of two graphs
• Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer

This page was built for publication: A near packing of two graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850487)