On the minimum degree and edge-connectivity of a graph
Časopis pro pěstování matematiky (1976)
- Volume: 101, Issue: 2, page 199-202
- ISSN: 0528-2195
Access Full Article
top
How to cite
topNebeský, Ladislav. "On the minimum degree and edge-connectivity of a graph." Časopis pro pěstování matematiky 101.2 (1976): 199-202. <http://eudml.org/doc/21261>.
@article{Nebeský1976,
author = {Nebeský, Ladislav},
journal = {Časopis pro pěstování matematiky},
language = {eng},
number = {2},
pages = {199-202},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {On the minimum degree and edge-connectivity of a graph},
url = {http://eudml.org/doc/21261},
volume = {101},
year = {1976},
}
TY - JOUR
AU - Nebeský, Ladislav
TI - On the minimum degree and edge-connectivity of a graph
JO - Časopis pro pěstování matematiky
PY - 1976
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 101
IS - 2
SP - 199
EP - 202
LA - eng
UR - http://eudml.org/doc/21261
ER -
References
top- M. Behzad G. Chartrand, Introduction to the Theory of Graphs, Allyn and Bacon, Inc., Boston 1971. (1971) MR0432461
- R. Halin, A theorem on -connected graphs, J. Combinatorial Theory 7 (1969), 150-154. (1969) Zbl0172.25803MR0248042
- D. R. Lick, Minimally -line connected graphs, J. reine angew. Math. 252 (1972), 178-182. (1972) Zbl0233.05118MR0291003
- L. Nebeský, An upper bound for the minimum degree of a graph, (submitted to publication).
NotesEmbed ?
topYou 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.