Existence of $n$-factors in powers of connected graphs
Časopis pro pěstování matematiky, Tome 115 (1990) no. 1, pp. 9-17
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
Wisztová, Elena. Existence of $n$-factors in powers of connected graphs. Časopis pro pěstování matematiky, Tome 115 (1990) no. 1, pp. 9-17. doi: 10.21136/CPM.1990.108730
@article{10_21136_CPM_1990_108730,
author = {Wisztov\'a, Elena},
title = {Existence of $n$-factors in powers of connected graphs},
journal = {\v{C}asopis pro p\v{e}stov\'an{\'\i} matematiky},
pages = {9--17},
year = {1990},
volume = {115},
number = {1},
doi = {10.21136/CPM.1990.108730},
mrnumber = {1044009},
zbl = {0735.05069},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.21136/CPM.1990.108730/}
}
TY - JOUR AU - Wisztová, Elena TI - Existence of $n$-factors in powers of connected graphs JO - Časopis pro pěstování matematiky PY - 1990 SP - 9 EP - 17 VL - 115 IS - 1 UR - http://geodesic.mathdoc.fr/articles/10.21136/CPM.1990.108730/ DO - 10.21136/CPM.1990.108730 LA - en ID - 10_21136_CPM_1990_108730 ER -
[1] M. Behzad G. Chartrand: Introduction to the Theory of Graphs. Allyn and Bacon, Boston 1971. | MR
[2] G. Chartrand S. F. Kapoor: The cube of every connected graph is 1-hamiltonian. J. Res. Nat. Bur. Stand. B 73 (1969), 47-48. | MR
[3] F. Harary: Graph Theory. Addison-Wesley, Reading (Mass.) 1969. | MR | Zbl
[4] L. Nebeský E. Wisztová: Regular factors in powers of connected graphs. Časopis pěst. mat. 106 (1981) 52-59. | MR
Cité par Sources :