Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs
From MaRDI portal
Publication:1045112
DOI10.1016/j.disc.2009.04.023zbMath1183.05019OpenAlexW4213185651MaRDI QIDQ1045112
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.04.023
Related Items (20)
Solving the maximum internal spanning tree problem on interval graphs in polynomial time ⋮ A simple linear time algorithm to solve the MIST problem on interval graphs ⋮ Spectral radius and spanning trees of graphs ⋮ Spanning trees whose stems are spiders ⋮ A spanning tree with at most \(k\) leaves in a \(K_{1,p}\)-free graph ⋮ \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs ⋮ Spanning trees with few peripheral branch vertices in a connected claw-free graph ⋮ Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs ⋮ Spanning 3-ended trees in almost claw-free graphs ⋮ Spanning trees: A survey ⋮ Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs ⋮ A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs ⋮ Spanning trees with few peripheral branch vertices ⋮ Spanning 5-ended trees in \(K_{1,5}\)-free graphs ⋮ Spanning trees whose stems have a bounded number of branch vertices ⋮ Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs ⋮ Spanning trees whose reducible stems have a few branch vertices ⋮ Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs ⋮ Spanning trees with at most 6 leaves in \(K_{1,5}\)-free graphs ⋮ Spanning \(k\)-ended trees in quasi-claw-free graphs
Cites Work
This page was built for publication: Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs
