Geodesic
Almost all Graphs have a Spanning Cycle
Canadian mathematical bulletin, Tome 15 (1972) no. 1, pp. 39-41

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

DOI

A graph is a collection of nodes some pairs of which are joined by a single edge. A k-path, or a path of length k, is a sequence of nodes {p1 p2,... Pk+1} such that Pi is joined to pi+1 for 1 ≤i≤k; we assume the nodes are distinct except that p1 and pk+1 may be the same in which case we call the path a k-cycle or a cycle of length k. (Notice that two nodes joined by an edge determine a 2-cycle according to this definition; it will also be convenient to regard a single node as a 1-cycle.) A spanning path or cycle is one that involves every node of the graph. One of the unsolved problems of graph theory is to characterize those graphs that have a spanning path or cycle. 
Moon, J. W. Almost all Graphs have a Spanning Cycle. Canadian mathematical bulletin, Tome 15 (1972) no. 1, pp. 39-41. doi: 10.4153/CMB-1972-008-3
@article{10_4153_CMB_1972_008_3,
     author = {Moon, J. W.},
     title = {Almost all {Graphs} have a {Spanning} {Cycle}},
     journal = {Canadian mathematical bulletin},
     pages = {39--41},
     year = {1972},
     volume = {15},
     number = {1},
     doi = {10.4153/CMB-1972-008-3},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1972-008-3/}
}
TY  - JOUR
AU  - Moon, J. W.
TI  - Almost all Graphs have a Spanning Cycle
JO  - Canadian mathematical bulletin
PY  - 1972
SP  - 39
EP  - 41
VL  - 15
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1972-008-3/
DO  - 10.4153/CMB-1972-008-3
ID  - 10_4153_CMB_1972_008_3
ER  - 
%0 Journal Article
%A Moon, J. W.
%T Almost all Graphs have a Spanning Cycle
%J Canadian mathematical bulletin
%D 1972
%P 39-41
%V 15
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1972-008-3/
%R 10.4153/CMB-1972-008-3
%F 10_4153_CMB_1972_008_3

Cité par Sources :