scientific article; zbMATH DE number 1947432
From MaRDI portal
Publication:4411401
zbMath1019.68821MaRDI QIDQ4411401
Krzysztof Loryś, Grazyna Zwozniak
Publication date: 8 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2461/24610686.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (6)
Complexity of the maximum leaf spanning tree problem on planar and regular graphs ⋮ Max-leaves spanning tree is APX-hard for cubic graphs ⋮ Spanning Trees with Many Leaves in Regular Bipartite Graphs ⋮ Spanning trees: A survey ⋮ A 2-approximation algorithm for finding a spanning tree with maximum number of leaves ⋮ Connected domination of regular graphs
This page was built for publication:
