Arbres avec un nombre maximum de sommets pendants

DOI10.1016/0012-365X(84)90163-8MaRDI QIDQ793746zbMATH OpenFDO

Authors N. E. Zubov

Publication date 1984

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

maximum degreespanning treependant vertices

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Recommendations

• scientific article; zbMATH DE number 4008429
• 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 large number of end vertices
• Spanning Trees with Few Branch Vertices

Cites work

• scientific article; zbMATH DE number 3742629 (Why is no real title available?)
• scientific article; zbMATH DE number 3490998 (Why is no real title available?)
• scientific article; zbMATH DE number 3518832 (Why is no real title available?)
• Self-stabilizing systems in spite of distributed control
• Two-Processor Scheduling with Start-Times and Deadlines

Cited in

(10)

• Leaf realization problem, caterpillar graphs and prefix normal words
• scientific article; zbMATH DE number 1465679 (Why is no real title available?)
• A Simple 2-Approximation for Maximum-Leaf Spanning Tree
• Out-branchings with maximal number of leaves or internal vertices: algorithmic results and open problems
• A note on connected domination number and leaf number
• Connected domination
• A 2-approximation algorithm for finding a spanning tree with maximum number of leaves
• On the analysis of the \((1+1)\) evolutionary algorithm for the maximum leaf spanning tree problem
• Bounds on the leaf number in graphs of girth 4 or 5
• Radius, leaf number, connected domination number and minimum degree

This page was built for publication: Arbres avec un nombre maximum de sommets pendants

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