scientific article; zbMATH DE number 6424518

MaRDI QIDQ4982929zbMATH OpenFDO

Authors Masao Tsugaki, Yao Zhang

Publication date 13 April 2015

zbMATH Keywords

spanning treestem of a treetree with \(k\)-ended stem

Mathematics Subject Classification ID

Trees (05C05)

Recommendations

• Spanning trees whose reducible stems have a few branch vertices.
• Spanning trees whose stems have at most k leaves.
• Spanning trees with few leaves
• Spanning trees with few non-leaves
• Spanning Trees with Few Branch Vertices
• Spanning Trees with Many Leaves
• Spanning trees with many leaves
• Spanning trees with many leaves
• Spanning trees with few peripheral branch vertices
• Spanning trees with small degrees and few leaves

Cited in

(10)

• Spanning trees of connected \(K_{1,t}\)-free graphs whose stems have a few leaves
• Spanning trees with few peripheral branch vertices
• Spanning trees with few leaves
• Spanning trees with few peripheral branch vertices in a connected claw-free graph
• Spanning trees whose stems have at most k leaves.
• m-dominating k-ended trees of graphs
• Spanning trees whose reducible stems have a few branch vertices.
• Spanning trees with constraints on the leaf degree
• Spanning trees whose stems have a bounded number of branch vertices
• Spanning trees whose stems are spiders

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