Maximum matchings and trees
From MaRDI portal
Publication:1146984
DOI10.1016/0020-0190(80)90140-4zbMath0448.68017OpenAlexW2022901346MaRDI QIDQ1146984
Publication date: 1980
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(80)90140-4
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (8)
Disconnected matchings ⋮ Alternating Whitney sums and matchings in trees. 1 ⋮ New sharp lower bound for the quorum coloring number of trees ⋮ Depth-first search and the vertex cover problem ⋮ Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions ⋮ Star partitions on graphs ⋮ Contraction and deletion blockers for perfect graphs and \(H\)-free graphs ⋮ Solving some combinatorial problems on arrays with one-way dataflow
Cites Work
This page was built for publication: Maximum matchings and trees
