Author:
Matsubara Ryota,Tsugaki Masao,Yamashita Tomoki
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference6 articles.
1. Bondy, J.A.: Basic Graph Theory—Paths and Circuits. Handbook of Combinatorics, vol. I, pp. 5–110. Elsevier, Amsterdam (1995)
2. Bondy J.A., Chvátal V.: A method in graph theory. Discret. Math 15, 111–135 (1976)
3. Broersma H.J., Ryjáček Z., Schiermeyer I.: Closure concepts: a survey. Graph. Combin. 16, 17–48 (2000)
4. Kano, M., Kishimoto, H.: Spanning k-tree of n-connected graphs. Graph. Combin (2013, to appear)
5. Neumann-Lara V., Rivera-Campo E.: Spanning trees with bounded degrees. Combinatorica 11, 55–61 (1991)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Closure and Spanning Trees with Bounded Total Excess;Graphs and Combinatorics;2021-02-24
2. Spanning k-tree with specified vertices;Discrete Mathematics, Algorithms and Applications;2019-08