Arbres avec un nombre maximum de sommets pendants

DOI10.1016/0012-365X(84)90163-8zbMath0539.05037MaRDI QIDQ793746

N. E. Zubov

Publication date: 1984

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

spanning treependant verticesmaximum degree

Mathematics Subject Classification ID

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

Related Items (9)

Bounds on the leaf number in graphs of girth 4 or 5 ⋮ On the analysis of the (1+1) evolutionary algorithm for the maximum leaf spanning tree problem ⋮ Leaf realization problem, caterpillar graphs and prefix normal words ⋮ A Simple 2-Approximation for Maximum-Leaf Spanning Tree ⋮ Radius, leaf number, connected domination number and minimum degree ⋮ A 2-approximation algorithm for finding a spanning tree with maximum number of leaves ⋮ Connected Domination ⋮ Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems ⋮ A note on connected domination number and leaf number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Self-stabilizing systems in spite of distributed control
• Two-Processor Scheduling with Start-Times and Deadlines

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