Spanning trees with at most 3 leaves in K₁,4-free graphs

DOI10.1016/J.DISC.2009.04.023zbMATH Open1183.05019OpenAlexW4213185651MaRDI QIDQ1045112FDOQ1045112

Authors: Aung Kyaw 

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

Recommendations

• Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs
• Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs
• Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs
• Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs
• Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs

zbMATH Keywords

degree sumleafspanning tree\(K_{1,4}\)-free

Mathematics Subject Classification ID

Trees (05C05)

Cites Work

• Title not available (Why is that?)
• Neighborhood unions and extremal spanning trees

Cited In (22)

• Spanning 5-ended trees in \(K_{1,5}\)-free graphs
• \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs
• Spanning 3-ended trees in almost claw-free graphs
• Solving the maximum internal spanning tree problem on interval graphs in polynomial time
• Spanning trees: A survey
• Spanning trees with few peripheral branch vertices
• Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
• Spectral radius and spanning trees of graphs
• Spanning trees whose stems have a bounded number of branch vertices
• Spanning trees whose reducible stems have a few branch vertices.
• Spanning trees with at most \(5\) leaves and branch vertices in total of \(K_{1,5}\)-free graphs
• Spanning trees whose stems are spiders
• Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs
• A simple linear time algorithm to solve the MIST problem on interval graphs
• Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs
• Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs
• Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs
• A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs
• Spanning trees with at most 6 leaves in \(K_{1,5}\)-free graphs
• Spanning \(k\)-ended trees in quasi-claw-free graphs
• A spanning tree with at most \(k\) leaves in a \(K_{1,p}\)-free graph
• Spanning trees with few peripheral branch vertices in a connected claw-free graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045112)