scientific article; zbMATH DE number 2038756
From MaRDI portal
Publication:4449221
zbMath1039.68095MaRDI QIDQ4449221
Publication date: 8 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27190802.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (11)
Spanning spiders and light-splitting switches ⋮ The spanning k-trees, perfect matchings and spectral radius of graphs ⋮ Degree sums and spanning brooms of a graph ⋮ On non-traceable, non-hypotraceable, arachnoid graphs ⋮ Spanning trees: A survey ⋮ Relations, models and a memetic approach for three degree-dependent spanning tree problems ⋮ On spanning trees with few branch vertices ⋮ Spanning trees whose stems have a bounded number of branch vertices ⋮ Spanning trees with a bounded number of branch vertices in a claw-free graph ⋮ Spanning Trees with Few Branch Vertices ⋮ Approximating spanning trees with few branches
This page was built for publication:
