scientific article; zbMATH DE number 2157456

MaRDI QIDQ4670065zbMATH OpenFDO

Authors M. Sohel Rahman, Mohammad Kaykobad

Publication date 15 April 2005

Full work available at URL https://eudml.org/doc/51270, http://www.emis.de/journals/AMEN/2004/2004.htm

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

algorithmindependence numberspanning tree

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Spanning trees with leaves bounded by independence number
• Degree bounded spanning trees
• Spanning trees with bounded degrees
• Spanning trees of bounded degree
• Degree conditions and degree bounded trees

Cited in

(9)

• Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees
• scientific article; zbMATH DE number 989714 (Why is no real title available?)
• scientific article; zbMATH DE number 1444313 (Why is no real title available?)
• Spanning trees with leaves bounded by independence number
• Independent spanning trees with small depths in iterated line digraphs
• Spanning trees of bounded degree
• Degree bounded spanning trees
• Degree-bounded minimum spanning tree for unit disk graph
• An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem

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 Q4670065)