scientific article
From MaRDI portal
Publication:3929772
zbMath0474.05054MaRDI QIDQ3929772
David G. Kirkpatrick, Pavol Hell
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Graph theory (05C99) History of combinatorics (05-03)
Related Items
The minimum degree threshold for perfect graph packings ⋮ Packings by Complete Bipartite Graphs ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ On generalized matching problems ⋮ Packing bipartite graphs with covers of complete bipartite graphs ⋮ Packing paths perfectly ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems) ⋮ Packings by cliques and by finite families of graphs
