Partition numbers, connectivity and Hamiltonicity
Časopis pro pěstování matematiky (1987)
- Volume: 112, Issue: 2, page 173-176
- ISSN: 0528-2195
Access Full Article
top
How to cite
topBorowiecki, Mieczysław. "Partition numbers, connectivity and Hamiltonicity." Časopis pro pěstování matematiky 112.2 (1987): 173-176. <http://eudml.org/doc/21671>.
@article{Borowiecki1987,
author = {Borowiecki, Mieczysław},
journal = {Časopis pro pěstování matematiky},
keywords = {partition numbers; connectivity; critical graphs; hamiltonicity},
language = {eng},
number = {2},
pages = {173-176},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {Partition numbers, connectivity and Hamiltonicity},
url = {http://eudml.org/doc/21671},
volume = {112},
year = {1987},
}
TY - JOUR
AU - Borowiecki, Mieczysław
TI - Partition numbers, connectivity and Hamiltonicity
JO - Časopis pro pěstování matematiky
PY - 1987
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 112
IS - 2
SP - 173
EP - 176
LA - eng
KW - partition numbers; connectivity; critical graphs; hamiltonicity
UR - http://eudml.org/doc/21671
ER -
References
top- G. A. Dirac, Some theorems on abstract graphs, Proc. London Math. Soc., 2 (1952), 69-81. (1952) Zbl0047.17001MR0047308
- G. A. Dirac, On the structure of 5- and 6-chromatic graphs, J. Reine Аngew. Math., 214/215 (1964), 43-52. (1964) MR0162241
- F. Harary, Graph theory, Аddison-Wesley, Reading, Massachusetts, 1969. (1969) Zbl0196.27202MR0256911
- D. R. Lick A. T. White, k-degenerate graphs, Canadian J. Math., 22 (1970), 1082-1096. (1970) MR0266812
- P. J. McCarthy, The Existence of Hamiltonian Cycles in Cгitical Graphs, Bolletino U.M.I. (5) 18-А (1981), 213-217. (1981) MR0618338
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.