Factors of trees

DOI10.1016/0012-365X(94)90391-3MaRDI QIDQ1331986zbMATH OpenOpenAlexFDO

Authors Tao Wang

Publication date 29 August 1994

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(94)90391-3

zbMATH Keywords

algorithmsfactortree

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Review text

The author gives criteria for a tree \(T_ n\) to have an \(f\)-factor or a \((g,f)\)-factor that give rise to \(O(n)\) and \(O(n^ 2)\) algorithms for these two problems.

Cites work

• A graph polynomial and its applications
• A simple existence criterion for \((g<f)\)-factors
• Alternating Whitney sums and matchings in trees. 1
• An algorithmic proof of Tutte's f-factor theorem
• Generalized 1-factorization of trees
• Graph theory
• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• scientific article; zbMATH DE number 3895093 (Why is no real title available?)
• On factors with given components
• Subgraphs with prescribed valencies
• The Factorization of Linear Graphs
• The Factors of Graphs
• The number of trees with a 1-factor
• The parity of the number of 1-factors of a graph
• Trees with 1-factors and oriented trees

This page was built for publication: Factors of trees

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