Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs
type: Item
instance of: scholarly article
title: Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs
zbMATH Open document ID: 1235.05033
author: Aung Kyaw
published in: Discrete Mathematics
publication date: 2011-10-21T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 5961723
zbMATH Keywords: spanning tree
zbMATH Keywords: leaf
zbMATH Keywords: degree sum
zbMATH Keywords: \(K_{1, 4}\)-free
zbMATH Keywords: spanning \(t\)-ended system
MaRDI profile type: Publication
full work available at URL: j.disc.2011.06.025
OpenAlex ID: W1992714766
cites work: Q5422499
cites work: Spanning spiders and light-splitting switches
cites work: Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs
cites work: On a conjecture of Las Vergnas concerning certain spanning trees in graphs
DOI: 10.1016/J.DISC.2011.06.025
description: scientific article; zbMATH DE number 5961723