scientific article; zbMATH DE number 3743308

MaRDI QIDQ3929772zbMATH OpenFDO

Authors Pavol Hell, David Kirkpatrick

Publication date 1981

zbMATH Keywords

computational complexity

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) History of combinatorics (05-03) Graph theory (05C99) Analysis of algorithms and problem complexity (68Q25)

Cited in

(8)

• Combinatorial analysis (nonnegative matrices, algorithmic problems)
• Packings by cliques and by finite families of graphs
• On generalized matching problems
• The minimum degree threshold for perfect graph packings
• Packing bipartite graphs with covers of complete bipartite graphs
• Packings by Complete Bipartite Graphs
• Packing paths perfectly
• Graph factors and factorization: 1985--2003: a survey

This page was built for publication:

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