Geodesic
Maximum graphs non-Hamiltonian-connected from a vertex
Glasgow mathematical journal, Tome 25 (1984) no. 1, pp. 97-98

Voir la notice de l'article provenant de la source Cambridge University Press

A path (cycle) in a graph G is called a hamiltonian path (cycle) of G if it contains every vertex of G. A graph is hamiltonian if it contains a hamiltonian cycle. A graph G is hamiltonian-connectedif it contains a u-vhamiltonian path for each pair u, v of distinct vertices of G. A graph G is hamiltonian-connected from a vertex v of G if G contains a v-whamiltonian path for each vertex w≠v. Considering only graphs of order at least 3, the class of graphs hamiltonian-connected from a vertex properly contains the class of hamiltonian-connected graphs and is properly contained in the class of hamiltonian graphs. 
Hendry, G. R. T. Maximum graphs non-Hamiltonian-connected from a vertex. Glasgow mathematical journal, Tome 25 (1984) no. 1, pp. 97-98. doi: 10.1017/S0017089500005462
@article{10_1017_S0017089500005462,
     author = {Hendry, G. R. T.},
     title = {Maximum graphs {non-Hamiltonian-connected} from a vertex},
     journal = {Glasgow mathematical journal},
     pages = {97--98},
     year = {1984},
     volume = {25},
     number = {1},
     doi = {10.1017/S0017089500005462},
     url = {http://geodesic.mathdoc.fr/articles/10.1017/S0017089500005462/}
}
TY  - JOUR
AU  - Hendry, G. R. T.
TI  - Maximum graphs non-Hamiltonian-connected from a vertex
JO  - Glasgow mathematical journal
PY  - 1984
SP  - 97
EP  - 98
VL  - 25
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.1017/S0017089500005462/
DO  - 10.1017/S0017089500005462
ID  - 10_1017_S0017089500005462
ER  - 
%0 Journal Article
%A Hendry, G. R. T.
%T Maximum graphs non-Hamiltonian-connected from a vertex
%J Glasgow mathematical journal
%D 1984
%P 97-98
%V 25
%N 1
%U http://geodesic.mathdoc.fr/articles/10.1017/S0017089500005462/
%R 10.1017/S0017089500005462
%F 10_1017_S0017089500005462

[1] 1.Bondy, J. A., Variations on the Hamiltonian theme, Canad. Math. Bull. 15 (1972), 57–62. Google Scholar | DOI

[2] 2.Chartrand, G. and Nordhaus, E. A., Graphs Hamiltonian-connected from a vertex, The theory and applications of graphs, edited by Chartrand, G. et al. (John Wiley, 1981), 189–201. Google Scholar

[3] 3.Ore, O., Hamilton connected graphs, J. Math. Pures Appl. 42 (1963), 21–27. Google Scholar

[4] 4.Ore, O., Note on Hamilton circuits, Amer. Math. Monthly 67 (1960), 55. Google Scholar | DOI

Cité par Sources :