Factors of trees

DOI10.1016/0012-365X(94)90391-3zbMATH Open0802.05031OpenAlexW2032613386MaRDI QIDQ1331986FDOQ1331986

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

treealgorithmsfactor

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• The Factorization of Linear Graphs
• Title not available (Why is that?)
• The Factors of Graphs
• Subgraphs with prescribed valencies
• An algorithmic proof of Tutte's f-factor theorem
• On factors with given components
• A graph polynomial and its applications
• A simple existence criterion for \((g<f)\)-factors
• The parity of the number of 1-factors of a graph
• Alternating Whitney sums and matchings in trees. 1
• Generalized 1-factorization of trees
• Title not available (Why is that?)
• The number of trees with a 1-factor
• 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)