Spanning trees with leaves bounded by independence number

zbMATH Open1161.05311MaRDI QIDQ5505231FDOQ5505231

Authors: Lingli Sun 

Publication date: 26 January 2009

Full work available at URL: https://eudml.org/doc/55352

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

Recommendations

• scientific article; zbMATH DE number 2157456
• Spanning Trees with Many Leaves
• Spanning trees with many leaves: lower bounds in terms of the number of vertices of degree 1, 3 and at least 4
• Spanning trees with bounded degrees and leaves
• Bounds of the number of leaves of spanning trees

Mathematics Subject Classification ID

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

Cited In (3)

• Spanning trees with bounded degrees and leaves
• Title not available (Why is that?)
• Bounds of the number of leaves of spanning trees in graphs without triangles

This page was built for publication: Spanning trees with leaves bounded by independence number

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