On packing bipartite graphs

DOI10.1007/BF01285818zbMath0772.05079MaRDI QIDQ1200276

Péter Hajnal

Publication date: 17 January 1993

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

degreepackingbipartite graphs

Mathematics Subject Classification ID

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

Related Items (4)

A list version of graph packing ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On the Bollobás–Eldridge Conjecture for Bipartite Graphs ⋮ On the bipartite graph packing problem

Cites Work

• Unnamed Item
• Edge disjoint placement of graphs
• Two theorems on packings of graphs
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• An \(\Omega{} (n^{4/3})\) lower bound on the randomized complexity of graph properties
• Embedding (p,p - 1) graphs in their complements
• Packings of graphs and applications to computational complexity
• Subgraphs of graphs. I
• Packing a tree with a graph of the same size
• Embedding graphs in their complements
• Every (p,p-2) graph is contained in its complement
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: On packing bipartite graphs