f-factors and related decompositions of graphs
From MaRDI portal
Publication:1147717
DOI10.1016/0095-8956(80)90056-8zbMath0451.05035OpenAlexW1975102601MaRDI QIDQ1147717
Publication date: 1980
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(80)90056-8
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spanning subgraphs with specified valencies
- 1-Faktoren von Graphen. (1-factors of graphs)
- Maximal Flow Through a Network
- Paths, Trees, and Flowers
- Subgraphs with prescribed valencies
- On the structure of factorizable graphs
- On the structure of factorizable graphs. II
- The Factorization of Linear Graphs
- The Factors of Graphs
- A Short Proof of the Factor Theorem for Finite Graphs