On generalized matching problems
From MaRDI portal
Publication:1149783
DOI10.1016/0020-0190(81)90073-9zbMath0454.68077MaRDI QIDQ1149783
Pavol Hell, David G. Kirkpatrick
Publication date: 1981
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(81)90073-9
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
A parameter linked with \(G\)-factors and the binding number, On the tree packing problem, Generalized partitions of graphs, Maximum tree-packing in time \(O(n^{5/2})\), Maximum packing for biconnected outerplanar graphs, Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time