ABZAEHLBARUNENDLICHE GRAPHEN MIT HAMILTONSCHER DRITTER POTENZ. = GRAPHES ENUMERABLES AVEC UN CUBE HAMILTONIENHEINRICH P.1978; MATH. NACHR.; DTSCH.; DA. 1978; VOL. 82; PP. 231-239; BIBL. 3 REF.Article

HAMILTONIAN CIRCUITS IN PRISMS OVER CERTAIN SIMPLE 3-POLYTOPES.GOODEY PR; ROSENFELD M.1978; DISCRETE MATH.; NETHERL.; DA. 1978; VOL. 21; NO 3; PP. 229-235; BIBL. 10 REF.Article

SUR CERTAINS GRAPHES AYANT UN CIRCUIT HAMILTONIEN UNIQUE.ABDULKADER ISSAM.1976; IN: ANAL. APPL. INF. JOURN. COMB. INF.; BORDEAUX; 1975; BORDEAUX; UNIV. BORDEAUX I; DA. 1976; PP. 1-6; BIBL. 6 REF.Conference Paper

AN ALGORITHM WHICH GENERATES THE HAMILTONIAN CIRCUITS OF A CUBIC PLANAR MAPPRICE WL.1978; J. LONDON MATH. SOC.; GBR; DA. 1978; VOL. 18; NO 2; PP. 193-201; BIBL. 7 REF.Article

UEBER HAMILTONSCHE KREISE UND UNABHAENGIGE ECKEN IN GRAPHEN = CIRCUITS HAMILTONIENS ET SOMMETS INDEPENDANTS DANS DES GRAPHESBIGALKE A; JUNG HA.1979; MONATSH. MATH.; AUT; DA. 1979; VOL. 88; NO 3; PP. 195-210; ABS. ENG; BIBL. 7 REF.Article

INDICE DE PARTITION EN CHEMINS DES ARCS DES TOURNOIS AYANT UN SEUL CIRCUIT HAMILTONIENISSAM ABDUL KADER.1978; PROBLEMES COMBINATOIRES ET THEORIE DES GRAPHES. CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE. COLLOQUE INTERNATIONAL. 260/1976/ORSAY; FRA; PARIS: CNRS; DA. 1978; PP. 1-2; ABS. ENG; BIBL. 5 REF.Conference Paper

CERTAINES PROPRIETES DES TOURNOIS AVANT UN CIRCUIT HAMILTONIEN UNIQUEISSAM ABDUL KADER.1980; REV. ROUM. MATH. PURES APPL.; ISSN 0035-3965; ROM; DA. 1980; VOL. 25; NO 10; PP. 1441-1451; ABS. ENG; BIBL. 9 REF.Article

ON AN EXTENSION OF THE GRINBERG THEAREM.SHIMAMOTO Y.1978; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1978; VOL. 24; NO 2; PP. 169-180; BIBL. 6 REF.Article

AN APPLICATION OF MAXIMUM-MINIMUM DISTANCE CIRCUITS ON HYPERCUBESSIMMONS GJ.1978; LECTURE NOTES MATH.; DEU; DA. 1978; NO 686; PP. 290-299; BIBL. 5 REF.Conference Paper

THE NOMBER OF HAMILTONIAN CIRCUITS IN LARGE, HEAVILY EDGED GRAPHS.SHEEHAN J; WRIGHT EM.1977; GLASGOW MATH. J.; G.B.; DA. 1977; VOL. 18; NO 1; PP. 35-37; BIBL. 4 REF.Article

A TOPOLOGICAL TRANSFORMATION ALGORITHM WHICH RELATES THE HALMITONIAN CIRCUITS OF A CUBIC PLANAR MAP.PRICE WL.1977; J. LONDON MATH. SOC.; G.B.; DA. 1977; VOL. 15; NO 2; PP. 193-196Article

DETECTION OF HAMILTONIAN CIRCUITS IN A DIRECTED GRAPHKARMAKAR SB.1982; J. AUST. MATH. SOC., SER. B, APPL. MATH.; ISSN 0334-2700; AUS; DA. 1982; VOL. 24; NO 2; PP. 234-242; BIBL. 7 REF.Article

ON REGULAR GRAPHS AND HAMILTONIAN CIRCUITS, INCLUDING ANSWERS TO SOME QUESTIONS OF JOSEPH ZAKSOWENS PJ.1980; J. COMBINATOR. THEORY, B; USA; DA. 1980; VOL. 28; NO 3; PP. 262-277; BIBL. 10 REF.Article

PAIRS OF ADJACENT HAMILTONIAN CIRCUITS WITH SMALL INTERSECTIONWEST DB.1978; STUD. APPL. MATH.; USA; DA. 1978; VOL. 59; NO 3; PP. 245-248; BIBL. 8 REF.Article

HAMILTONIAN PROPERTIES IN THE GRAPHS OF ORE-TYPE-(K).ROBERTS J.1977; BULL. LONDON MATH. SOC.; G.B.; DA. 1977; VOL. 9; NO 27 PART. 3; PP. 295-298; BIBL. 6 REF.Article

BOUNDS ON THE NUMBER OF HAMILTONIAN CIRCUITS IN THE N-CUBE.DOUGLAS RJ.1977; DISCRETE MATH.; NETHERL.; DA. 1977; VOL. 17; NO 2; PP. 143-146; BIBL. 7 REF.Article

OPTIMAL CROSSING-FREE HAMILTONIAN CIRCUIT DRAWINGS OF K_NNEWBORN M; MOSER WOJ.1980; J. COMBINATOR. THEORY, B; USA; DA. 1980; VOL. 29; NO 1; PP. 13-26; BIBL. 4 REF.Article

COMBINATION GENERATORSPAYNE WH; IVES FM.1979; A.C.M. TRANS. MATH. SOFTWARE; USA; DA. 1979; VOL. 5; NO 2; PP. 163-172; BIBL. 14 REF.Article

A SUFFICIENT CONDITION FOR HAMILTONIAN CIRCUITSWOODALL DR.1978; J. COMBINATOR. THEORY, B; USA; DA. 1978; VOL. 25; NO 2; PP. 184-186; BIBL. 4 REF.Article

AN ANALYSIS OF APPROXIMATIONS FOR FINDING A MAXIMUM WEIGHT HAMILTONIAN CIRCUITFISHER ML; NEMHAUSER GL; WOLSEY LA et al.1979; OPER. RES.; USA; DA. 1979; VOL. 27; NO 4; PP. 799-809; BIBL. 10 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

THE PLANAR HAMILTONIAN CIRCUIT PROBLEM IS NP-COMPLETE.GAREY MR; JOHNSON DS; TARJAN RE et al.1976; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1976; VOL. 5; NO 4; PP. 704-714; BIBL. 9 REF.Article

A SUFFICIENT CONDITION FOR THE EXISTENCE OF AN HAMILTONIAN CHAIN IN A FINITE SIMPLE GRAPH.VENTRE AGS.1975; RIV. MAT. UNIV. PARMA; ITAL.; DA. 1975 PARU 1977; VOL. 4; NO 1; PP. 119-124; ABS. ITAL.; BIBL. 5 REF.Article

DATA-DEPENDENT BOUNDS FOR HEURISTICS TO FIND A MINIMUM WEIGHT HAMILTONIAN CIRCUITJONKER R; KAAS R; VOLGENANT T et al.1980; OPER. RES.; ISSN 0030-364X; USA; DA. 1980; VOL. 28; NO 5; PP. 1219-1222; BIBL. 5 REF.Article

UN ALGORITHME DE RECHERCHE EXHAUSTIVE POUR TROUVER DES CYCLES HAMILTONIENSZEPS DA.1980; ELEKTRON. INFORMATIONSVERARB. KYBERN.; ISSN 0013-5712; DDR; DA. 1980; VOL. 16; NO 1-3; PP. 69-75; ABS. GER/ENG; BIBL. 7 REF.Article