On a conjecture of Las Vergnas concerning certain spanning trees in graphs
From MaRDI portal
Publication:1138562
DOI10.1007/BF03322958zbMath0432.05035WikidataQ122998662 ScholiaQ122998662MaRDI QIDQ1138562
Publication date: 1979
Published in: Results in Mathematics (Search for Journal in Brave)
Related Items (32)
Spanning trees with bounded degrees and leaves ⋮ Chvátal–Erdős Theorem: Old Theorem with New Aspects ⋮ A note on a spanning 3-tree ⋮ \(m\)-dominating \(k\)-ended trees of \(l\)-connected graphs ⋮ Spectral radius and spanning trees of graphs ⋮ \(m\)-dominating \(k\)-ended trees of graphs ⋮ Unnamed Item ⋮ A spanning tree with at most \(k\) leaves in a \(K_{1,p}\)-free graph ⋮ Neighborhood unions and extremal spanning trees ⋮ Spanning trees with few peripheral branch vertices in a connected claw-free graph ⋮ Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs ⋮ 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 ⋮ Spanning trees with bounded degrees ⋮ Spanning trees with few peripheral branch vertices ⋮ A note on the independence number, connectivity and \(k\)-ended tree ⋮ Spanning trees with few leaves ⋮ Spanning trees of connected \(K_{1,t}\)-free graphs whose stems have a few leaves ⋮ Spanning 5-ended trees in \(K_{1,5}\)-free graphs ⋮ An extension of the Win theorem: counting the number of maximum independent sets ⋮ Number of vertices of degree three in spanning 3-trees in square graphs ⋮ Unnamed Item ⋮ On spanning trees with few branch vertices ⋮ The independence number condition for the existence of a spanning f-tree ⋮ 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 a bounded number of branch vertices in a claw-free graph ⋮ Spanning trees with at most 6 leaves in \(K_{1,5}\)-free graphs ⋮ Spanning \(k\)-ended trees in quasi-claw-free graphs ⋮ Spanning 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