共 50 条
- [2] ENTIRE GRAPH OF A BRIDGELESS CONNECTED PLANE GRAPH IS PANCONNECTED JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 1975, 12 (DEC): : 59 - 66
- [4] SQUARE OF A NONSEPARABLE GRAPH IS HAMILTONIAN CONNECTED NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1971, 18 (03): : 553 - &
- [5] POWERS OF A CONNECTED GRAPH ARE HIGHLY HAMILTONIAN NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1970, 17 (06): : 941 - &
- [6] POWERS OF A CONNECTED GRAPH ARE HIGHLY HAMILTONIAN JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1971, B 75 (1-2): : 63 - +
- [10] The hamiltonian chromatic number of a connected graph without large hamiltonian-connected subgraphs Czechoslovak Mathematical Journal, 2006, 56 : 317 - 338