A near packing of two graphs

DOI10.1006/jctb.2000.1971zbMath1029.05122OpenAlexW2054349075MaRDI QIDQ1850487

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

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

Packing two graphs of even girth 10 ⋮ Near packings of graphs ⋮ Near packings of two graphs ⋮ On a graph packing conjecture by Bollobás, Eldridge and Catlin ⋮ 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
• 2-factors in dense graphs
• Packing of three copies of a graph
• Packing two forests into a bipartite graph

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