b-Matchings in Trees
- 1 March 1976
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 5 (1) , 104-108
- https://doi.org/10.1137/0205009
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A note on finding the bridges of a graphInformation Processing Letters, 1974
- On the hamiltonian completion problemLecture Notes in Mathematics, 1974
- On covering the points of a graph with point disjoint pathsLecture Notes in Mathematics, 1974
- On simple characterizations of k-treesDiscrete Mathematics, 1974
- Time bounds for selectionJournal of Computer and System Sciences, 1973
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965