A linear algorithm for the number of degree constrained subforests of a tree

DOI10.1016/0020-0190(82)90103-XzbMATH Open0505.68028OpenAlexW2082736938MaRDI QIDQ1836478FDOQ1836478

Authors: Peter Slater 

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(82)90103-x

zbMATH Keywords

path coverb-matchingendvertex listspanning subforest

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Title not available (Why is that?)
• Depth-First Search and Linear Graph Algorithms
• A note on finding the bridges of a graph
• Title not available (Why is that?)
• A linear algorithm for a core of a tree
• Path coverings of the vertices of a tree
• On the optional hamiltonian completion problem
• On a class of polynomials associated with the paths in a graph and its application to minimum nodes disjoint path coverings of graphs
• Title not available (Why is that?)
• b-Matchings in Trees

This page was built for publication: A linear algorithm for the number of degree constrained subforests of a tree

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