On a Hamiltonian cycle of the fourth power of a connected graph
Mathematica Bohemica (1991)
- Volume: 116, Issue: 4, page 385-390
- ISSN: 0862-7959
Access Full Article
topAbstract
topHow to cite
topReferences
top- M. Behzad G. Chartrand L. Lesniak-Foster, Graphs & Digraphs, Prindle. Weber & Schmidt, Boston 1979. (1979) MR0525578
- F. Harary, Graph Theory, Addison-Wesley, Reading, Mass., 1969. (1969) Zbl0196.27202MR0256911
- L. Nebeský, On the existence of a 3-factor in the fourth power of a graph, Čas. pěst. mat. 105 (1980), 204-207. (1980) MR0573113
- L. Nebeský, Edge-disjoint 1-factors in powers of connected graphs, Czech. Math. J. 34 (109) (1984), 499-505. (1984) MR0764434
- L. Nebeský, On a 1-factor of the fourth power of a connected graph, Čas. pěst. mat. 113 (1988), 415-420. (1988) MR0981882
- J. Sedláček, Introduction into the Graph Theory, (Czech). Academia nakl. ČSAV, Praha 1981. (1981)
- E. Wisztová, A hamiltonian cycle and a 1-factor in the fourth power of a graph, Čas. pěst. mat. 110 (1985), 403-412. (1985) MR0820332