Spanning trees with at most 6 leaves in \(K_{1,5}\)-free graphs

DOI10.1155/2019/1348348zbMath1435.05168OpenAlexW2977359852MaRDI QIDQ2298039

Yanyan Li

Publication date: 20 February 2020

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2019/1348348

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

A spanning tree with at most \(k\) leaves in a \(K_{1,p}\)-free graph

Cites Work

• Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs
• Spanning trees: A survey
• Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs
• On a conjecture of Las Vergnas concerning certain spanning trees in graphs
• Spanning spiders and light-splitting switches
• Independence trees and Hamilton cycles
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Spanning trees with at most 6 leaves in \(K_{1,5}\)-free graphs