Previous |  Up |  Next

Article

Title: Two edge-disjoint Hamiltonian cycles of powers of a graph (English)
Author: Nebeský, Ladislav
Author: Wisztová, Elena
Language: English
Journal: Časopis pro pěstování matematiky
ISSN: 0528-2195
Volume: 110
Issue: 3
Year: 1985
Pages: 294-301
.
Category: math
.
MSC: 05C45
idZBL: Zbl 0583.05040
idMR: MR808080
DOI: 10.21136/CPM.1985.118236
.
Date available: 2009-09-23T09:32:36Z
Last updated: 2020-07-29
Stable URL: http://hdl.handle.net/10338.dmlcz/118236
.
Reference: [1] M. Behzad G. Chartrand, L. Lesniak-Foster: Graphs & Digraphs.Prindle, Weber & Schmidt, Boston 1979. MR 0525578
Reference: [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 0321809
Reference: [3] F. Harary: Graph Theory.Addison-Wesley, Reading (Mass.) 1969. Zbl 0196.27202, MR 0256911
Reference: [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 0573113
Reference: [5] L. Nebeský, E. Wisztová: Regular factors in powers of connected graphs.Časopis pěst. mat. 106 (1981), 52-59. MR 0613706
Reference: [6] M. Sekanina: On an ordering of the set of vertices of a connected graph.Publ. Sci. Univ. Brno 412 (1960), 137-142. Zbl 0118.18903, MR 0140095
Reference: [7] D. P. Sumner: Graphs with 1-factors.Proc. Amer. Math. Soc. 42 (1974), 8-12. Zbl 0293.05157, MR 0323648
.

Files

Files Size Format View
CasPestMat_110-1985-3_8.pdf 588.2Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo