Connected Factors and Spanning Trees in Graphs

Keywords

Combinatorics, Mathematics, Spanning tree, Minimum degree spanning tree, Tree (set theory)

References

• Graph Theory with ApplicationsE. Keith Lloyd — 1978
• Graph Theory with ApplicationsJ. A. Bondy, U. S. R. Murty — 1976

Cited by

• Graph Factors and Matching ExtensionsQinglin Yu, Guizhen Liu — 2009
• Spanning trees and spanning Eulerian subgraphs with small degreesMorteza Hasanvand — 2015
• Connected Factors in Graphs – a SurveyMekkia Kouider, Preben Dahl Vestergaard — 2005
• The existence of m-tree-connected (g,f+f'-m)-factors using (g,f)-factors and m-tree-connected (m,f')-factorsMorteza Hasanvand — 2022

Related papers

• Number of Spanning Trees of Some Simple GraphsJiang Shen-qing — 2007
• Conditions for Implicit-Degree Sum for Spanning Trees with Few Leaves in K1,4-Free GraphsJunqing Cai, Cheng‐Kuan Lin, Qiang Sun — 2023
• Reinforcing the number of disjoint spanning treesDamin Liu, Hong‐Jian Lai, Zhi‐Hong Chen — 2009
• Spanning Trees: A SurveyKenta Ozeki, Tomoki Yamashita — 2011
• Spanning Trees in 2-treesP. Renjith, N. Sadagopan, Douglas B. West — 2016
• Some results on spanning treesBing Yao, Zhong-fu Zhang, Jianfang Wang — 2010
• Spanning k-Trees of n-Connected GraphsMikio Kanō, Hiroo Kishimoto — 2011