Arbres avec un nombre maximum de sommets pendants

DOI10.1016/0012-365X(84)90163-8zbMATH Open0539.05037MaRDI QIDQ793746FDOQ793746

Authors: N. E. Zubov 

Publication date: 1984

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

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

zbMATH Keywords

maximum degreespanning treependant vertices

Mathematics Subject Classification ID

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

Cites Work

• Self-stabilizing systems in spite of distributed control
• Title not available (Why is that?)
• Two-Processor Scheduling with Start-Times and Deadlines
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• A note on connected domination number and leaf number
• Leaf realization problem, caterpillar graphs and prefix normal words
• Title not available (Why is that?)
• A Simple 2-Approximation for Maximum-Leaf Spanning Tree
• Bounds on the leaf number in graphs of girth 4 or 5
• Out-branchings with maximal number of leaves or internal vertices: algorithmic results and open problems
• On the analysis of the \((1+1)\) evolutionary algorithm for the maximum leaf spanning tree problem
• 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

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)