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

DOI10.37236/11698MaRDI QIDQ6117248

Masao Tsugaki, Kenta Ozeki

Publication date: 16 February 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian path\(k\)-ended tree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factors and factorizations of graphs. Proof techniques in factor theory
• Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs
• 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 trees with at most 6 leaves in \(K_{1,5}\)-free graphs
• Longest paths and cycles in K1,3-free graphs
• Independence trees and Hamilton cycles
• Some Theorems on Abstract Graphs
• Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs

This page was built for publication: A spanning tree with at most \(k\) leaves in a \(K_{1,p}\)-free graph