scientific article; zbMATH DE number 6116784
From MaRDI portal
Publication:4897473
zbMath1265.05100MaRDI QIDQ4897473
Kenta Ozeki, Aung Kyaw, Haruhide Matsuda, Tomoki Yamashita, Akira Saito, Mikio Kano
Publication date: 19 December 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (18)
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 ⋮ Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-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 few peripheral branch vertices ⋮ Depth first search in claw-free graphs ⋮ Spanning 5-ended trees in \(K_{1,5}\)-free graphs ⋮ On spanning trees with few branch vertices ⋮ On 3-stable number conditions in \(n\)-connected claw-free graphs ⋮ 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 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
This page was built for publication:
