A theorem on -connected graphs

Ladislav Nebeský

Časopis pro pěstování matematiky (1975)

  • Volume: 100, Issue: 2, page 116-117
  • ISSN: 0528-2195

How to cite

top

Nebeský, Ladislav. "A theorem on $2$-connected graphs." Časopis pro pěstování matematiky 100.2 (1975): 116-117. <http://eudml.org/doc/19604>.

@article{Nebeský1975,
author = {Nebeský, Ladislav},
journal = {Časopis pro pěstování matematiky},
language = {eng},
number = {2},
pages = {116-117},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {A theorem on $2$-connected graphs},
url = {http://eudml.org/doc/19604},
volume = {100},
year = {1975},
}

TY - JOUR
AU - Nebeský, Ladislav
TI - A theorem on $2$-connected graphs
JO - Časopis pro pěstování matematiky
PY - 1975
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 100
IS - 2
SP - 116
EP - 117
LA - eng
UR - http://eudml.org/doc/19604
ER -

References

top
  1. M. Behzad, G. Chartrand, Introduction to the Theory of Graphs, Allyn and Bacon, Inc., Boston 1971. (1971) Zbl0238.05101MR0432461

NotesEmbed ?

top

You must be logged in to post comments.