Closure for Spanning Trees with k-Ended Stems

Zheng Yan
2014 Open Journal of Discrete Mathematics  
A closure operation is a useful operation in the study of the existence of cycles, paths and other subgraphs in graphs. It was first introduced by Bondy and Chvátal[1].
doi:10.4236/ojdm.2014.43008 fatcat:osjtcn73xretdljuhr5ahmjt54