On the existence of critically n-connected graphs

Ferdinand Gliviak

Mathematica Slovaca (1976)

  • Volume: 26, Issue: 1, page 53-56
  • ISSN: 0232-0525

How to cite

top

Gliviak, Ferdinand. "On the existence of critically n-connected graphs." Mathematica Slovaca 26.1 (1976): 53-56. <http://eudml.org/doc/31752>.

@article{Gliviak1976,
author = {Gliviak, Ferdinand},
journal = {Mathematica Slovaca},
language = {eng},
number = {1},
pages = {53-56},
publisher = {Mathematical Institute of the Slovak Academy of Sciences},
title = {On the existence of critically n-connected graphs},
url = {http://eudml.org/doc/31752},
volume = {26},
year = {1976},
}

TY - JOUR
AU - Gliviak, Ferdinand
TI - On the existence of critically n-connected graphs
JO - Mathematica Slovaca
PY - 1976
PB - Mathematical Institute of the Slovak Academy of Sciences
VL - 26
IS - 1
SP - 53
EP - 56
LA - eng
UR - http://eudml.org/doc/31752
ER -

References

top
  1. CHARTRAND G., KAUGARS A., LICK D. R., Critically n-connected graphs, Proc. A.М.S., 32, 1972, 63-68. (1972) Zbl0228.05118MR0290999
  2. DIRAC G. A., Minimally 2-connected graphs, J. Reine Angew. Math., 228, 1967, 204-216. (1967) Zbl0153.25804MR0216975
  3. ERDÖS P., KELLY P., The minimal regular graph containing a givеn graph, Amеr. Math. Monthly, 70, 1963, 1074-1075. (1963) MR1532429
  4. HALIN R., A theorеm on n-connеctеd graphs, J. Comb. Th., 7, 1969, 150-154. (1969) MR0248042
  5. HALIN R., Zur Thеoriе dеr n-faсh zusammеnhängеndеn Graphеn, Abh. Math. Sеm. Univ. Hamburg, 33, 1969, 133-164. (1969) MR0258664
  6. HALIN R., Untеrsuchungеn übеr minimalе n-fach zusammеnhängеndе Graphen, Math. Ann., 182, 1969, 175-188. (1969) MR0278979
  7. HALIN R., JUNG H. A., Über Minimalstrukturen von Graphen, insbesondеrҽ von n-fach zusammenhängenden Graphen, Math. Ann., 152, 1963, 75-94. (1963) MR0155315
  8. HARARY F., Graph theory, Reading, Addison-Wesley 1969. (1969) Zbl0196.27202MR0256911
  9. HEDETNIEMI S., Characterizations and constructions of minimally 2-connected graphs and minimally strong digraphs, Proc. Louisiana Conf. on Comb., Graph Theory and Computing, Baton Rouge, 1971, 257-283. (1971) Zbl0297.05120MR0319799
  10. LICK D. R., Minimally n-line connected graphs, J. Reine Angew. Math., 252, 1972, 178-182. (1972) Zbl0233.05118MR0291003
  11. MADER W., Minimalе n-faсh zusimmеnhängende Gгaphеn mit maximalѳг Кantеnzahl, J. Rеinе Angеw. Math., 249, 1971, 201-207. (1971) 
  12. MADER W., Existеnz gewisser Konfìgurationen in n-gesättigten Graphen und in Graphen genügend gгoßer Kantendichte, Math. Ann., 194, 1971, 295-312. (194,) MR0289344
  13. MADER W., Existenz n-fach zusammenhängender Teilgraphen in Graphen gеnügend grosseг Kantendichte, Abh. Math. Sеm. Univ. Hamburg, 37, 1972. 86-97. (1972) MR0306050
  14. MADER W., Ecken von Innen- und Aussengrad n in minimal n-fach kantеi zusammenhängenden Digraphen, Arch. Math., 25, 1974, 107-112. (1974) MR0340087
  15. PLUMMER M. D., On minimal blocks, Trans. A.M.S., 134, 1968, 85-94. (1968) Zbl0187.21101MR0228369

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.