Geodesic
Two edge-disjoint Hamiltonian cycles of powers of a graph
Časopis pro pěstování matematiky, Tome 110 (1985) no. 3, pp. 294-301

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

DOI MR   Zbl

DOI : 10.21136/CPM.1985.118236
Classification : 05C45 
Nebeský, Ladislav; Wisztová, Elena. Two edge-disjoint Hamiltonian cycles of powers of a graph. Časopis pro pěstování matematiky, Tome 110 (1985) no. 3, pp. 294-301. doi: 10.21136/CPM.1985.118236
@article{10_21136_CPM_1985_118236,
     author = {Nebesk\'y, Ladislav and Wisztov\'a, Elena},
     title = {Two edge-disjoint {Hamiltonian} cycles of powers of a graph},
     journal = {\v{C}asopis pro p\v{e}stov\'an{\'\i} matematiky},
     pages = {294--301},
     year = {1985},
     volume = {110},
     number = {3},
     doi = {10.21136/CPM.1985.118236},
     mrnumber = {808080},
     zbl = {0583.05040},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CPM.1985.118236/}
}
TY  - JOUR
AU  - Nebeský, Ladislav
AU  - Wisztová, Elena
TI  - Two edge-disjoint Hamiltonian cycles of powers of a graph
JO  - Časopis pro pěstování matematiky
PY  - 1985
SP  - 294
EP  - 301
VL  - 110
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CPM.1985.118236/
DO  - 10.21136/CPM.1985.118236
LA  - en
ID  - 10_21136_CPM_1985_118236
ER  - 
%0 Journal Article
%A Nebeský, Ladislav
%A Wisztová, Elena
%T Two edge-disjoint Hamiltonian cycles of powers of a graph
%J Časopis pro pěstování matematiky
%D 1985
%P 294-301
%V 110
%N 3
%U http://geodesic.mathdoc.fr/articles/10.21136/CPM.1985.118236/
%R 10.21136/CPM.1985.118236
%G en
%F 10_21136_CPM_1985_118236

[1] M. Behzad G. Chartrand, L. Lesniak-Foster: Graphs & Digraphs. Prindle, Weber & Schmidt, Boston 1979. | MR

[2] G. Chartrand A. D. Polimeni, M. J. Stewart: The existence of 1-factors in line graphs, squares, and total graphs. Indagationes Math. 35 (1973), 228-232. | MR

[3] F. Harary: Graph Theory. Addison-Wesley, Reading (Mass.) 1969. | MR | Zbl

[4] L. Nebeský: On the existence of a 3-factor in the fourth power of a graph. Časopis pěst. mat. 105 (1980), 204-207. | MR

[5] L. Nebeský, E. Wisztová: Regular factors in powers of connected graphs. Časopis pěst. mat. 106 (1981), 52-59. | MR

[6] M. Sekanina: On an ordering of the set of vertices of a connected graph. Publ. Sci. Univ. Brno 412 (1960), 137-142. | MR | Zbl

[7] D. P. Sumner: Graphs with 1-factors. Proc. Amer. Math. Soc. 42 (1974), 8-12. | MR | Zbl

Cité par Sources :