RECENT RESULTS ON TREES.HARARY F.1974; LECTURE NOTES MATH.; GERM.; DA. 1974; NO 406; PP. 1-9; BIBL. 11 REF.; (GRAPHS AND COMB. PROC. CAP. CONG. GRAPH THEORY COMB.; WASHINGTON; 1973)Conference Paper

HAMILTONIAN PATHS IN VERTEX-SYMMETRIC GRAPHS OF ORDER 5PMARUSIC D; PARSONS TD.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 42; NO 2-3; PP. 227-242; BIBL. 16 REF.Article

ON HAMILTONIAN WALKS IN GRAPHS.GOODMAN SE; HEDETNIEMI ST.1974; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1974; VOL. 3; NO 3; PP. 214-221; BIBL. 5 REF.Article

A SEARCH PROCEDURE FOR HAMILTON PATHS AND CIRCUITS.RUBIN F.1974; J. ASS. COMPUTY MACHIN.; U.S.A.; DA. 1974; VOL. 21; NO 4; PP. 576-580; BIBL. 10 REF.Article

EVERY FINITE STRONGLY CONNECTED DIGRAPH OF STABILITY 2 HAS A HAMILTONIAN PATHCHEN CC; MANALASTAS P JR.1983; DISCRETE MATHEMATICS; ISSN 0012-365X; NLD; DA. 1983; VOL. 44; NO 3; PP. 243-250; BIBL. 2 REF.Article

GRAPHES DE COMPARABILITE D'ARBRES ET D'ARBORESCENCES.ARDITTI JC.1975; AO-CNRS-11237; FR.; DA. 1975; PP. (136P.); BIBL. 2 P.; (THESE DOCT. SCI. MATH.; PIERRE ET MARIE CURIE)Thesis

ON K-PATH HAMILTONIEN MAXIMAL PLANAR GRAPHSBAYBARS I.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 40; NO 1; PP. 119-121; BIBL. 8 REF.Article

THE EFFECT OF NUMBER OF HAMILTONIAN PATHS ON THE COMPLEXITY OF A VERTEX-CALORING PROBLEMMANBER U; TOMPA M.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 220-227; BIBL. 5 REF.Conference Paper

THE EDGE HAMILTONIAN PATH PROBLEM IS NP-COMPLETEBERTOSSI AA.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 4-5; PP. 157-159; BIBL. 8 REF.Article

ON THE ENUMERATION OF HAMILTONIAN ROADS AND CIRCUITS IN CERTAIN PARTIAL GRAPHS OF K_NCIOBOTARU S.1978; REC. ROUMAINE MATH. PURES APPL.; ROM; DA. 1978; VOL. 23; NO 10; PP. 1487-1496; BIBL. 6 REF.Article

HEURISTIC FOR THE HAMILTONIAN PATH PROBLEM IN EUCLIDIAN TWO SPACENORBACK JP; LOVE RF.1979; J. OPERAT. RES. SOC.; GBR; DA. 1979; VOL. 30; NO 4; PP. 363-368; BIBL. 8 REF.Article

NEGATIVE RESULTS ON COUNTINGVALIANT LG.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 67; PP. 38-46; BIBL. 32 REF.Conference Paper

HAMILTON PATHS IN GRID GRAPHSITAI A; PAPADIMITRIOU CH; SZWARCFITER JL et al.1982; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 4; PP. 676-686; BIBL. 10 REF.Article

MODELE DE SERVICE D'OBJETS ELOIGNESRUBAL'SKIJ GB.1980; IZVEST. AKAD. NAUK S.S.S.R., TEKH. KIBERN.; SUN; DA. 1980; NO 1; PP. 86-92; BIBL. 3 REF.Article

Infinite Hamiltonian paths in Cayley digraphsJUNGREIS, I. L.Discrete mathematics. 1985, Vol 54, Num 2, pp 167-180, issn 0012-365XArticle

The hamiltonicity of bipartite graphs involving neighborhood unionsGUANTAO CHEN; SAITO, Akira; BING WEI et al.Discrete mathematics. 2002, Vol 249, Num 1-3, pp 45-56, issn 0012-365XConference Paper

On minimum degree in hamiltonian path graphsHENDRY, G. R. T.Journal of graph theory. 1988, Vol 12, Num 4, pp 491-497, issn 0364-9024Article

Stable set meeting every longest pathHAVET, F.Discrete mathematics. 2004, Vol 289, Num 1-3, pp 169-173, issn 0012-365X, 5 p.Article

P systems with gemmation of mobile membranesBESOZZI, Daniela; ZANDRON, Claudio; MAURI, Giancarlo et al.Lecture notes in computer science. 2001, pp 136-153, issn 0302-9743, isbn 3-540-42672-8Conference Paper

Generating linear extensions by adjacent transpositionsWEST, D. B.Journal of combinatorial theory. Series B. 1993, Vol 58, Num 1, pp 58-64, issn 0095-8956Article

The branching graphs of polyhexes: some elementary theorems, conjectures and open questionsKIRBY, E. C; GUTMAN, I.Journal of mathematical chemistry. 1993, Vol 13, Num 3-4, pp 359-374, issn 0259-9791Article

On rotations and the generation of binary treesLUCAS, J. M; ROELANTS VAN BARONAIGIEN, D; RUSKEY, F et al.Journal of algorithms (Print). 1993, Vol 15, Num 3, pp 343-366, issn 0196-6774Article

Hamiltonian decomposition of K_n^*, patterns with distinct differences, and Tuscan squaresETZION, T.Discrete mathematics. 1991, Vol 91, Num 3, pp 259-276, issn 0012-365XArticle

An algorithm for finding Hamilton paths and cycles in random graphsBOLLOBAS, B; FENNER, T. I; FRIEZE, A. M et al.Combinatorica (Print). 1987, Vol 7, Num 4, pp 327-341, issn 0209-9683Article

Finding a Hamilton path through a family on intervalsSRIDHAR, M. A; GOYAL, S.International journal of computer mathematics. 1994, Vol 51, Num 3-4, pp 133-140, issn 0020-7160Article