Trees with 1-factors and oriented trees
From MaRDI portal
Publication:1174177
DOI10.1016/0012-365X(91)90061-6zbMath0753.05028DBLPjournals/dm/Simion91WikidataQ56083438 ScholiaQ56083438MaRDI QIDQ1174177
Publication date: 25 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (4)
Factors of trees ⋮ On the number of matchings of a tree ⋮ Counting spanning trees with a Kekulé structure in linear hexagonal chains ⋮ Solution to a problem of C. D. Godsil regarding bipartite graphs with unique perfect matching
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphs and matching theorems
- Parallel concepts in graph theory
- The parity of the number of 1-factors of a graph
- A graph polynomial and its applications
- The Factorization of Linear Graphs
- Distinct representatives of subsets
- The Factors of Graphs
- A Short Proof of the Factor Theorem for Finite Graphs
This page was built for publication: Trees with 1-factors and oriented trees