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

Bohdan Zelinka

Kybernetika (1973)

  • Volume: 09, Issue: 5, page (357)-360
  • ISSN: 0023-5954

How to cite

top

Zelinka, Bohdan. "Finding a spanning tree of a graph with maximal number of terminal vertices." Kybernetika 09.5 (1973): (357)-360. <http://eudml.org/doc/27896>.

@article{Zelinka1973,
author = {Zelinka, Bohdan},
journal = {Kybernetika},
language = {eng},
number = {5},
pages = {(357)-360},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Finding a spanning tree of a graph with maximal number of terminal vertices},
url = {http://eudml.org/doc/27896},
volume = {09},
year = {1973},
}

TY - JOUR
AU - Zelinka, Bohdan
TI - Finding a spanning tree of a graph with maximal number of terminal vertices
JO - Kybernetika
PY - 1973
PB - Institute of Information Theory and Automation AS CR
VL - 09
IS - 5
SP - (357)
EP - 360
LA - eng
UR - http://eudml.org/doc/27896
ER -

References

top
  1. B. Г. Визинг, Некоторые нерешенные задачи в теории графов, Успехи мат. наук 23 (1968), 117-134. (1968) Zbl1099.01025MR0240000

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.