Spanning trees with few branch vertices in K1,4-free graphs
- 8 April 2024
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (7)
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China
This publication has 12 references indexed in Scilit:
- Spanning trees with at most 4 leaves in -free graphsDiscrete Mathematics, 2019
- Degree Conditions for Graphs to Have Spanning Trees with Few Branch Vertices and LeavesGraphs and Combinatorics, 2019
- Spanning trees homeomorphic to a small treeDiscrete Mathematics, 2016
- Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free GraphGraphs and Combinatorics, 2012
- Spanning trees with at most leaves in -free graphsDiscrete Mathematics, 2011
- Spanning Trees: A SurveyGraphs and Combinatorics, 2010
- Neighborhood unions and extremal spanning treesDiscrete Mathematics, 2008
- Spanning spiders and light-splitting switchesDiscrete Mathematics, 2004
- Spanning Trees with Bounded Number of Branch Vertices2002
- Independence trees and Hamilton cyclesJournal of Graph Theory, 1998