GRAPHICAL CYCLIC PERMUTATION GROUPSMOHANTY SP; SRIDHARAN MR; SHUKLA SK et al.1981; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1981; NO 885; PP. 339-346; BIBL. 5 REF.Conference Paper

SEARCH FOR MINIMAL TRIVALENT CYCLE PERMUTATION GRAPHS WITH GIRTH NINEPISANSKI T; SHAWE TAYLOR J.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 36; NO 1; PP. 113-115; BIBL. 6 REF.Article

NUMERISCHE EXISTENZHRITERIEN IN DER KOMBINATORIK. = CRITERES NUMERIQUES D'EXISTENCE EN COMBINATOIREKOEHLER E.1975; SER. INTERNATION. ANAL. NUMER.; SUISSE; DA. 1975; VOL. 29; PP. 99-108; ABS. ANGL.; BIBL. 3 REF.; (NUMER. METHOD. GRAPHENTHEOR. KOMB. PROBL. VORTRAGSAUSZ. TAG. NUMER. METHOD. GRAPHENTHEOR. KOMB.; OBERWOLFACH, SCHWARZWALD; 1974)Conference Paper

A CHARACTERIZATION OF CYCLIC GRAPHSCHARATONIK JJ; MIKLOS S.1982; BULLETIN DE L'ACADEMIE POLONAISE DES SCIENCES. SERIE DES SCIENCES MATHEMATIQUES; ISSN 0137-639X; POL; DA. 1982; VOL. 30; NO 9-10; PP. 453-455; ABS. RUS; BIBL. 2 REF.Article

MODIFIED LINEAR DEPENDENCE AND THE CAPACITY OF A CYCLIC GRAPH.STEIN SK.1977; LINEAR ALGEBRA APPL.; U.S.A.; DA. 1977; VOL. 17; NO 3; PP. 191-195; BIBL. 5 REF.Article

A PROBLEM CONCERNING J-PANCYCLIC GRAPHS.JACOS V; JENDROL S.1974; MAT. CAS.; CESKOSL.; DA. 1974; VOL. 24; NO 3; PP. 259-262; BIBL. 3 REF.Article

HAMILTONSCHE LINIEN IN DIGRAPHEN. = CYCLES HAMILTONIENS DANS DES DIGRAPHESOVERBECK LARISCH M.1975; SER. INTERNATION. ANAL. NUMER.; SUISSE; DA. 1975; VOL. 29; PP. 109-116; ABS. ANGL.; BIBL. 9 REF.; (NUMER. METHOD. GRAPHENTHEOR. KOMB. PROBL. VORTRAGSAUSZ. TAG. NUMER. METHOD. GRAPHENTHEOR. KOMB.; OBERWOLFACH, SCHWARZWALD; 1974)Conference Paper

A THEOREM CONCERNING CYCLIC DIRECTED GRAPHS WITH APPLICATIONS TO NETWORK RELIABILITYWILLIE RR.1980; NETWORKS; USA; DA. 1980; VOL. 10; NO 1; PP. 71-78; BIBL. 2 REF.Article

GRAPHES FAIBLEMENT CYCLIQUES AVEC DES SPECTRES CHROMATIQUES ENTIERSDMITRIEV IG.1980; METODY DISKRETN. ANAL.; SUN; DA. 1980; NO 34; PP. 3-7; BIBL. 7 REF.Article

STABLE AND SEMI-STABLE UNICYCLIC GRAPHS.MCAVANEY KL; GRANT DD; HOLTON DA et al.1974; DISCRETE MATH.; NETHERL.; DA. 1974; VOL. 9; NO 3; PP. 277-288; BIBL. 7 REF.Article

ENUMERATION OF CYCLIC GRAPHS AND CYCLIC DESIGNSDAVID HA.1972; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1972; VOL. 13; NO 3; PP. 303-308; BIBL. 9 REF.Serial Issue

A UNIFIED FORMULA FOR ANALYSIS OF SOME NETWORK RELIABILITY PROBLEMS = UNE FORMULE UNIFIEE POUR L'ANALYSE DE QUELQUES PROBLEMES DE FIABILITE DE RESEAUSATYANARAYANA A.1982; IEEE TRANS. RELIAB.; ISSN 0018-9529; USA; DA. 1982; VOL. 31; NO 1; PP. 23-32; BIBL. 11 REF.Article

ACYCLIC AND TOTALLY CYCLIC ORIENTATIONS OF COMBINATORIAL GEOMETRIES.LAS VERGNAS M.1977; DISCRETE MATH.; NETHERL.; DA. 1977; VOL. 20; NO 1; PP. 51-61; BIBL. 17 REF.Article

Submaps of maps. II : Cyclically k-connected planar cubic mapsBENDER, E. A; GAO, Z.-C; MCCUAIG, W. D et al.Journal of combinatorial theory. Series B. 1992, Vol 55, Num 1, pp 118-124, issn 0095-8956Article

Reference counting of cyclic graphs for functional programsAXFORD, T. H.Computer journal (Print). 1990, Vol 33, Num 5, pp 466-470, issn 0010-4620, 5 p.Article

Longest cycles in 3-connected planar graphsJACKSON, B; WORMALD, N. C.Journal of combinatorial theory. Series B. 1992, Vol 54, Num 2, pp 291-321, issn 0095-8956Article

New Ramsey bounds from cyclic graphs of prime orderCALKIN, N. J; ERDÖS, P; TOVEY, C. A et al.SIAM journal on discrete mathematics (Print). 1997, Vol 10, Num 3, pp 381-387, issn 0895-4801Article

Edge reductions in cyclically k-connected cubic graphsMCCUAIG, W.Journal of combinatorial theory. Series B. 1992, Vol 56, Num 1, pp 16-44, issn 0095-8956Article

Cyclic Haar graphsHLADNIK, Milan; MARUSIC, Dragan; PISANSKI, Tomaz et al.Discrete mathematics. 2002, Vol 244, Num 1-3, pp 137-152, issn 0012-365XConference Paper

An efficient algorithm for cyclic reference countingDUEIRE LINS, Rafael.Information processing letters. 2002, Vol 83, Num 3, pp 145-150, issn 0020-0190Article

On the odd cycles of normal graphsDE SIMONE, C; KÖRNER, J.Discrete applied mathematics. 1999, Vol 94, Num 1-3, pp 161-169, issn 0166-218XConference Paper