Existence of -factors in powers of connected graphs
Časopis pro pěstování matematiky (1990)
- Volume: 115, Issue: 1, page 9-17
- ISSN: 0528-2195
Access Full Article
topHow to cite
topWisztová, Elena. "Existence of $n$-factors in powers of connected graphs." Časopis pro pěstování matematiky 115.1 (1990): 9-17. <http://eudml.org/doc/19560>.
@article{Wisztová1990,
author = {Wisztová, Elena},
journal = {Časopis pro pěstování matematiky},
keywords = {-factor},
language = {eng},
number = {1},
pages = {9-17},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {Existence of $n$-factors in powers of connected graphs},
url = {http://eudml.org/doc/19560},
volume = {115},
year = {1990},
}
TY - JOUR
AU - Wisztová, Elena
TI - Existence of $n$-factors in powers of connected graphs
JO - Časopis pro pěstování matematiky
PY - 1990
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 115
IS - 1
SP - 9
EP - 17
LA - eng
KW - -factor
UR - http://eudml.org/doc/19560
ER -
References
top- M. Behzad G. Chartrand, Introduction to the Theory of Graphs, Allyn and Bacon, Boston 1971. (1971) MR0432461
- G. Chartrand S. F. Kapoor, The cube of every connected graph is 1-hamiltonian, J. Res. Nat. Bur. Stand. B 73 (1969), 47-48. (1969) MR0238729
- F. Harary, Graph Theory, Addison-Wesley, Reading (Mass.) 1969. (1969) Zbl0196.27202MR0256911
- L. Nebeský E. Wisztová, Regular factors in powers of connected graphs, Časopis pěst. mat. 106 (1981) 52-59. (1981) MR0613706
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.