On a conjecture of Las Vergnas concerning certain spanning trees in graphs

From MaRDI portal
Publication:1138562

DOI10.1007/BF03322958zbMath0432.05035WikidataQ122998662 ScholiaQ122998662MaRDI QIDQ1138562

Sein Win

Publication date: 1979

Published in: Results in Mathematics (Search for Journal in Brave)




Related Items (32)

Spanning trees with bounded degrees and leavesChvátal–Erdős Theorem: Old Theorem with New AspectsA note on a spanning 3-tree\(m\)-dominating \(k\)-ended trees of \(l\)-connected graphsSpectral radius and spanning trees of graphs\(m\)-dominating \(k\)-ended trees of graphsUnnamed ItemA spanning tree with at most \(k\) leaves in a \(K_{1,p}\)-free graphNeighborhood unions and extremal spanning treesSpanning trees with few peripheral branch vertices in a connected claw-free graphSpanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphsSpanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphsSpanning 3-ended trees in almost claw-free graphsSpanning trees: A surveySpanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphsSpanning trees with bounded degreesSpanning trees with few peripheral branch verticesA note on the independence number, connectivity and \(k\)-ended treeSpanning trees with few leavesSpanning trees of connected \(K_{1,t}\)-free graphs whose stems have a few leavesSpanning 5-ended trees in \(K_{1,5}\)-free graphsAn extension of the Win theorem: counting the number of maximum independent setsNumber of vertices of degree three in spanning 3-trees in square graphsUnnamed ItemOn spanning trees with few branch verticesThe independence number condition for the existence of a spanning f-treeSpanning trees whose reducible stems have a few branch verticesSpanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphsSpanning trees with a bounded number of branch vertices in a claw-free graphSpanning trees with at most 6 leaves in \(K_{1,5}\)-free graphsSpanning \(k\)-ended trees in quasi-claw-free graphsSpanning k-ended trees of 3-regular connected graphs




Cites Work




This page was built for publication: On a conjecture of Las Vergnas concerning certain spanning trees in graphs