Factors of trees

DOI10.1016/0012-365X(94)90391-3zbMath0802.05031OpenAlexW2032613386MaRDI QIDQ1331986

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

treealgorithmsfactor

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On factors with given components
• A simple existence criterion for \((g<f)\)-factors
• The number of trees with a 1-factor
• Alternating Whitney sums and matchings in trees. 1
• Generalized 1-factorization of trees
• Trees with 1-factors and oriented trees
• The parity of the number of 1-factors of a graph
• A graph polynomial and its applications
• An algorithmic proof of Tutte's f-factor theorem
• Subgraphs with prescribed valencies
• The Factorization of Linear Graphs
• The Factors of Graphs

This page was built for publication: Factors of trees