ANTIPODAL EMBEDDINGS OF GRAPHS.FARZAN M; WALLER DA.1977; J. LONDON MATH. SOC.; G.B.; DA. 1977; VOL. 15; NO 3; PP. 377-383; BIBL. 7 REF.Article

HOMOPOLAR CIRCUITS IN POLAR GRAPHSANDERSEN LD; GRANT DD.1981; CZECH. MATH. J.; ISSN 0011-4642; CSK; DA. 1981; VOL. 31; NO 2; PP. 218-228; BIBL. 9 REF.Article

SOME CHARACTERIZATION THEOREMS FOR CIRCUIT SPACES ASSOCIATED WITH GRAPHS.BRYANT V; PERFECT H.1977; DISCRETE MATH.; NETHERL.; DA. 1977; VOL. 18; NO 2; PP. 109-124; BIBL. 5 REF.Article

ON SPANNING AND DOMINATING CIRCUITS IN GRAPHS.LESNIAK FOSTER L; WILLIAMSON JE.1977; BULL. CANAD. MATH.; CANADA; DA. 1977; VOL. 20; NO 2; PP. 215-220; BIBL. 4 REF.Article

SNAKES IN POWERS OF COMPLETE GRAPHS.ABBOTT HL; DIERKER PF.1977; S.I.A.M. J. APPL. MATH.; U.S.A.; DA. 1977; VOL. 32; NO 2; PP. 347-355; BIBL. 4 REF.Article

MAXIMAL CIRCUITS OF GRAPHS. I.WOODALL DR.1976; ACTA MATH. ACAD. SCI. HUNGR.; HONGR.; DA. 1976; VOL. 28; NO 1-2; PP. 77-80; BIBL. 5 REF.Article

ON LONGEST PATHS AND CIRCUITS IN GRAPHS.ZAMFIRESCU T.1976; MATH. SCAND.; DANEM.; DA. 1976; VOL. 32; NO 8; PP. 211-239; BIBL. 19 REF.Article

EULERSCHE LINIEN UND KREISUEBERDECKUNGEN, DIE VORGEGEBENE DURCHGAENGE IN DEN KANTEN VERMEIDEN = GRAPHE EULERIEN ET RECOUVREMENT DE CERCLES, QUI EVITE DES TRAVERSEES DONNEES D'ARETESFLEISCHNER H.1980; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1980; VOL. 29; NO 2; PP. 145-167; BIBL. 2 REF.Article

A HAMILTONIAN DECOMPOSITION OF K*_2M.2M >OU= 8TILLSON TW.1980; J. COMBINATOR. THEORY, B; USA; DA. 1980; VOL. 29; NO 1; PP. 68-74; BIBL. 4 REF.Article

FINDING A MINIMUM CIRCUIT IN A GRAPHITAI A; RODEH M.1978; S.I.A.M. J. COMPUTG; USA; DA. 1978; VOL. 7; NO 4; PP. 413-423; BIBL. 10 REF.Article

COUNTEREXAMPLE TO A CONJECTURE OF JEURISSENSEYMOUR PD.1978; DISCRETE MATH.; NLD; DA. 1978; VOL. 24; NO 3; PP. 315; BIBL. 1 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

NOTE ON CIRCUITS CONTAINING SPECIFIED EDGES.THOMASSEN C.1977; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1977; VOL. 22; NO 3; PP. 279-280; BIBL. 1 REF.Article

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

ON THE MAXIMUM NUMBER OF DIAGONALS OF A CIRCUIT IN A GRAPHRAM PRAKASH GUPTA; KAHN J; ROBERTSON N et al.1980; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1980; VOL. B2; NO 1; PP. 37-43; BIBL. 4 REF.Article

INFINITE SUBGRAPHS AS MATROID CIRCUITSMATTHEWS LR.1979; J. COMBINATOR. THEORY, B; USA; DA. 1979; VOL. 27; NO 3; PP. 260-273; BIBL. 13 REF.Article

CIRCUITS THROUGH SPECIFIED EDGESHAGGKVIST R; THOMASSEN C.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 41; NO 1; PP. 29-34; BIBL. 14 REF.Article

ALGEBRAIC DETERMINATION OF CIRCUITS IN A DIRECTED GRAPHSRIMANI PK; ABHIJIT SENGUPTA.1979; INTERNATION. J. SYST. SCI.; GBR; DA. 1979; VOL. 10; NO 12; PP. 1409-1413; BIBL. 7 REF.Article

MAXIMALE GERADE UND UNGERADE KREISE IN GRAPHEN I. = CIRCUITS ORIENTES ET NON ORIENTES MAXIMAUX DANS LES GRAPHES IVOSS HJ; ZULUAGA C.1977; WISSENSCH. Z. TECH. HOCHSCH. ILMENAU; DTSCH.; DA. 1977; VOL. 23; NO 4; PP. 57-70; BIBL. 6 REF.Article

FINDING THE CIRCUITS OF A MATROID.MINIEKA E.1976; J. RES. NATION. BUR. STAND., B; U.S.A.; DA. 1976; VOL. 80; NO 3; PP. 337-342; BIBL. 11 REF.Article

ZUR BESTIMMUNG ALLER ELEMENTARKREISE IN GERICHTETEN GRAPHEN = SUR L'ENUMERATION DE TOUS LES CIRCUITS ELEMENTAIRES D'UN GRAPHE ORIENTEHANSEL K; JANICKE W; WOLIN JM et al.1978; MATH. OPER.-FORSCH. STATIST., OPTIMIZ; DDR; DA. 1978; VOL. 9; NO 3; PP. 427-440; ABS. ENG/RUS; BIBL. 22 REF.Article

QUELQUES ALGORITHMES D'ANALYSE DES GRAPHES ORIENTESMALYSHKO VV.1976; VESCI AKAD. NAVUK B.S.S.R., FIZ.-MAT. NAVUK; S.S.S.R.; DA. 1976; NO 5; PP. 33-36; BIBL. 14 REF.Article

ORDONNANCEMENT SUR DES GRAPHES MIXTES AVEC UNE PENALITE MAXIMALE LIMITEESOTSKOV YU N.1980; VESCI AKAD. NAVUK BSSR, SER. FIZ.-MAT. NAVUK; ISSN 0002-3574; BYS; DA. 1980; NO 2; PP. 37-41; ABS. ENG; BIBL. 9 REF.Article

PATHS AND CIRCUITS INFINITE GROUPS.HOLSZTYNSKI W; STRUBE RFE.1978; DISCRETE MATH.; NETHERL.; DA. 1978; VOL. 22; NO 3; PP. 263-272; BIBL. 5 REF.Article

REDUCTIBILITE MUTUELLE DE QUELQUES PROBLEMES EXTREMAUX DE LA THEORIE DES GRAPHESSERDYUKOV AI.1976; UPRAVL. SISTEMY; S.S.S.R.; DA. 1976; NO 15; PP. 68-73; BIBL. 6 REF.Article