On Two Conjectures on Packing of Graphs

DOI10.1017/S0963548305006887zbMath1080.05071OpenAlexW2034163816WikidataQ122923793 ScholiaQ122923793MaRDI QIDQ5704386

Kittikorn Nakprasit, Béla Bollobás, Alexandr V. Kostochka

Publication date: 14 November 2005

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548305006887

Mathematics Subject Classification ID

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

Related Items (6)

Packing two graphs of even girth 10 ⋮ Adapted game colouring of graphs ⋮ Efficient Graph Packing via Game Colouring ⋮ Packing \(d\)-degenerate graphs ⋮ Packing of graphs with small product of sizes ⋮ Packing Graphs of Bounded Codegree

This page was built for publication: On Two Conjectures on Packing of Graphs