scientific article; zbMATH DE number 2038756

MaRDI QIDQ4449221zbMATH OpenFDO

Authors Mikael Hammar, Luisa Gargano

Publication date 8 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2719/27190802.htm

zbMATH Keywords

Graph and network algorithmsGraph theory

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A spanning k-spider in a graph.
• Tough spiders
• Spanning spiders and light-splitting switches
• Spanning trees whose stems are spiders
• Neighborhood unions and extremal spanning trees

Cited in

(20)

• Spanning spiders and light-splitting switches
• Spider covers and their applications
• Degree sums and spanning brooms of a graph
• Spiders everywhere
• Relations, models and a memetic approach for three degree-dependent spanning tree problems
• On spanning trees with few branch vertices
• Approximating spanning trees with few branches
• The globally bi-\(3^*\) and hyper bi-\(3^*\) connectedness of the spider web networks
• The partite saturation number of spider
• On non-traceable, non-hypotraceable, arachnoid graphs
• scientific article; zbMATH DE number 1123806 (Why is no real title available?)
• A spanning k-spider in a graph.
• Spanning Trees with Few Branch Vertices
• Tough spiders
• The spanning k-trees, perfect matchings and spectral radius of graphs
• Degree conditions for spanning brooms
• Spanning trees: A survey
• 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
• Spiders can be recognized by counting their legs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449221)