Existence of $n$-factors in powers of connected graphs

Previous | Up | Next

Article

Existence of $n$-factors in powers of connected graphs. (English). Časopis pro pěstování matematiky, vol. 115 (1990), issue 1, pp. 9-17

References:

[1] M. Behzad G. Chartrand: Introduction to the Theory of Graphs. Allyn and Bacon, Boston 1971. MR 0432461

[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 0238729

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

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

Partner of