Finding a spanning tree of a graph with maximal number of terminal vertices

Previous | Up | Next

Article

Finding a spanning tree of a graph with maximal number of terminal vertices. (English). Kybernetika, vol. 9 (1973), issue 5, pp. (357)-360

MSC: 05-04, 05C05, 05Cxx | MR 0323598 | Zbl 0265.05101

References:

[1] B. Г. Визинг: Некоторые нерешенные задачи в теории графов. Успехи мат. наук 23 (1968), 117-134. MR 0240000 | Zbl 1099.01025

Partner of