b-Matchings in Trees

DOI10.1137/0205009zbMath0324.05002OpenAlexW1982255740MaRDI QIDQ4087194

Stephen T. Hedetniemi, S. Goodman, Robert Endre Tarjan

Publication date: 1976

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0205009

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Enumerative combinatorics (05A99) Graph theory (05C99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (5)

Cores of simplicial complexes ⋮ A linear algorithm for disjoint matchings in trees ⋮ Linear algorithms on recursive representations of trees ⋮ Partitioning trees: Matching, domination, and maximum diameter ⋮ A linear algorithm for the number of degree constrained subforests of a tree

This page was built for publication: b-Matchings in Trees