Author:
Griggs Jerrold R.,Kleitman Daniel J.,Shastri Aditya
Subject
Geometry and Topology,Discrete Mathematics and Combinatorics
Reference7 articles.
1. Lower bounds on the independence number in terms of the degrees
2. and , Spanning trees with many leaves in graphs of minimum degree 4 or 5, submitted (1989).
3. and , Spanning trees with many leaves, submitted (1988).
4. personal communication (1988).
5. Constructing full spanning trees for cubic graphs
Cited by
39 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Full degree spanning trees in random regular graphs;Discrete Applied Mathematics;2024-08
2. Spanning trees with few non-leaves;Israel Journal of Mathematics;2023-09
3. A Simple 2-Approximation for Maximum-Leaf Spanning Tree;International Journal of Foundations of Computer Science;2023-05-29
4. A note on connected domination number and leaf number;Discrete Mathematics;2023-02
5. Average distance and connected domination;AKCE International Journal of Graphs and Combinatorics;2023-01-02