SEPARATING CYCLES IN GRAPHS.BONOY JA; PLUMMER MD.1976; IN: BR. COMB. CONF. 5. PROC.; ABERDEEN; 1975; WINNIPEG; UTILITAS MATHEMATICA; DA. 1976; PP. 85-90; BIBL. 5 REF.Conference Paper

PANCYCLIC GRAPHS II.BONDY JA; INGLETON AW.1976; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1976; VOL. 20; NO 1; PP. 41-46; BIBL. 5 REF.Article

STRUCTURAL PROPERTIES AND CIRCUITS IN GRAPHS.DIRAC GA.1976; IN: BR. COMB. CONF. 5. PROC.; ABERDEEN; 1975; WINNIPEG; UTILITAS MATHEMATICA; DA. 1976; PP. 135-140Conference Paper

ON CYCLES THROUGH PRESCRIBED VERTICES IN WEAKLY SEPARABLE GRAPHSKELMANS AK; LOMONOSOV MV.1983; DISCRETE MATHEMATICS; ISSN 0012-365X; NLD; DA. 1983; VOL. 46; NO 2; PP. 183-189; BIBL. 10 REF.Article

WHEN M VERTICES IN A K-CONNECTED GRAPH CANNOT BE WALKED ROUND ALONG A SIMPLE CYCLEKELMANS AK; LOMONOSOV MV.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 38; NO 2-3; PP. 317-322; BIBL. 7 REF.Article

DECOMPOSITION DE LA SOMME CARTESIENNE D'UN CYCLE ET DE L'UNION DE DEUX CYCLES HAMILTONIENS EN CYCLES HAMILTONIENSAUBERT J; SCHNEIDER B.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 38; NO 1; PP. 7-16; ABS. ENG; BIBL. 6 REF.Article

BIPARTITE GRAPHS WITH CYCLES OF ALL EVEN LENGTHSSCHMEICHEL E; MITCHEM J.1982; J. GR. THEORY; ISSN 0364-9024; USA; DA. 1982; VOL. 6; NO 4; PP. 429-439; BIBL. 4 REF.Article

THE SEARCH FOR LONG PATHS AND CYCLES IN VERTEX-TRANSITIVE GRAPHS AND DIGRAPHSALSPACH B.1981; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1981; NO 884; PP. 14-22; BIBL. 26 REF.Conference Paper

ON CYCLES OF K INTEGERSHANSRAJ GUPTA.1980; INDIAN J. PURE APPL. MATH.; IND; DA. 1980; VOL. 11; NO 4; PP. 527-545; BIBL. 3 REF.Article

ON CYCLE BASES OF A GRAPHSYSLO MM.1979; NETWORKS; USA; DA. 1979; VOL. 9; NO 2; PP. 123-132; BIBL. 8 REF.Article

ON THE CYCLOMATIC NUMBER OF A HYPERGRAPHACHARYA BD.1979; DISCRETE MATH.; NLD; DA. 1979; VOL. 27; NO 2; PP. 111-116; BIBL. 9 REF.Article

THE CROSSING NUMBER OF C₃ X C_N.RINGEISEN RD; BEINEKE LW.1978; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1978; VOL. 24; NO 2; PP. 134-136; BIBL. 5 REF.Article

ON THE PERFECT GRAPH CONJONCTURE.MEYNIEL H.1976; DISCRETE MATH.; NETHERL.; DA. 1976; VOL. 16; NO 4; PP. 339-342; BIBL. 6 REF.Article

COVERS, MATCHINGS AND ODD CYCLES OF A GRAPH.JEURISSEN RH.1975; DISCRETE MATH.; NETHERL.; DA. 1975; VOL. 13; NO 3; PP. 251-260; BIBL. 13 REF.Article

ON THE MAXIMAL ORDER OF CYCLICITY OF ANTISYMMETRIC DIRECTED GRAPHS.KOTZIG A.1975; DISCRETE MATH.; NETHERL.; DA. 1975; VOL. 12; NO 1; PP. 17-25; BIBL. 3 REF.Article

PATH-CYCLE RAMSEY NUMBERS.FAUDREE RJ; LAWRENCE SL; PARSONS TD et al.1974; DISCRETE MATH.; NETHERL.; DA. 1974; VOL. 10; NO 3-4; PP. 269-277; BIBL. 12 REF.Article

INDICE DE PARTITION EN CHAINES D'UN GRAPHE SIMPLE ET PSEUDO-CYCLES HAMILTONIENS.JOLIVET JL.1974; C.R. ACAD. SCI., A; FR.; DA. 1974; VOL. 279; NO 13; PP. 479-481; BIBL. 8 REF.Article

AN OPTIMAL ALGORITHM TO DETECT A LINE GRAPH AND OUTPUT ITS ROOT GRAPH.LEHOT PGH.1974; J. ASS. COMPUTG MACHIN.; U. S.A.; DA. 1974; VOL. 21; NO 4; PP. 569-575; BIBL. 5 REF.Article

ALTERNATING CYCLES IN EDGE-PARTITIONED GRAPHSGROSSMAN JW; HAEGGKVIST R.1983; JOURNAL OF COMBINATORIAL THEORY. SERIES B; ISSN 0095-8956; USA; DA. 1983; VOL. 34; NO 1; PP. 77-81; BIBL. 7 REF.Article

CYCLE POLYNOMIALSHWANG FK.1981; PROC. AM. MATH. SOC.; ISSN 0002-9939; USA; DA. 1981; VOL. 83; NO 1; PP. 215-219; BIBL. 7 REF.Article

ON CERTAIN CYCLES IN GRAPHSGRANT DD.1981; PROC. EDINB. MATH. SOC.; ISSN 0013-0915; GBR; DA. 1981; VOL. 24; NO 1; PP. 15-17; BIBL. 8 REF.Article

ON A CYCLE FINDING ALGORITHMLOIZOU G.1980; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1980; VOL. 11; NO 1; PP. 33-36; BIBL. 9 REF.Article

ON A MINIMUM CYCLE BASIS OF A GRAPHKOLASINSKA E.1980; ZAOTOSOW. MAT.; POL; DA. 1980; VOL. 16; NO 4; PP. 631-639; ABS. POL; BIBL. 5 REF.Article

ON THE STRUCTURE OF CYCLES IN A GRAPHSYSLO MM.1979; BULL. ACAD. POL. SCI., SCI. MATH.; POL; DA. 1979; VOL. 27; NO 3-4; PP. 241-246; ABS. RUS; BIBL. 9 REF.Article

CYCLES AND SEMI-TOPOLOGICAL CONFIGURATIONS.BOLLOBAS B.1978; LECTURE NOTES MATH.; GERM.; DA. 1978; NO 642; PP. 66-74; BIBL. 13 REF.; (THEORY APPL. GRAPHS. INT. CONF. PROC.; KALAMAZOO; 1976)Conference Paper