CYCLES THROUGH PRESCRIBED AND FORBIDDEN POINT SETSHOLTON DA; PLUMMER MD.1982; NORTH-HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1982; NO 66; PP. 129-147; BIBL. 16 REF.Conference Paper

ODD CYCLES AND PERFECT GRAPHS.GREENWELL D.1978; LECTURE NOTES MATH.; GERM.; DA. 1978; NO 642; PP. 191-193; BIBL. 6 REF.; (THEORY APPL. GRAPHS. INT. CONF. PROC.; KALAMAZOO; 1976)Conference Paper

ON SEPARATING CYCLES IN GRAPHS.THOMASSEN C.1978; DISCRETE MATH.; NETHERL.; DA. 1978; VOL. 22; NO 1; PP. 57-73; BIBL. 11 REF.Article

CARACTERISATION SPECTRALE DU JOINT D'UN CYCLE PAR UN STABLEHEYDEMANN MC.1978; PROBLEMES COMBINATOIRES ET THEORIE DES GRAPHES. CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE. COLLOQUE INTERNATIONAL. 260/1976/ORSAY; FRA; PARIS: CNRS; DA. 1978; PP. 225-227; ABS. ENG; BIBL. 6 REF.Conference Paper

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

ON CHARACTERIZATIONS OF CYCLE GRAPHSSYSLO MM.1978; PROBLEMES COMBINATOIRES ET THEORIE DES GRAPHES. CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE. COLLOQUE INTERNATIONAL. 260/1976/ORSAY; FRA; PARIS: CNRS; DA. 1978; PP. 395-398; ABS. FRE; BIBL. 5 REF.Conference Paper

THE PROBLEM OF THE BICHROMATICS OF GRAPHS USING THE LANGUAGE OF MARKOV'S TRIGONOMETRIC PROBLEM OF MOMENTS.TUPITSYN VG.1978; J. COMBINATOR. THEORY, A; U.S.A.; DA. 1978; VOL. 24; NO 1; PP. 113-117; BIBL. 3 REF.Article

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

When the cartesian product of two directed cycles is hypo-hamiltonianPENN, L. E; WITTE, D.Journal of graph theory. 1983, Vol 7, Num 4, pp 441-443, issn 0364-9024Article

On longest cycles and strongly linking vertex setsFASSBENDER, B.Journal of graph theory. 1989, Vol 13, Num 6, pp 697-702, issn 0364-9024, 6 p.Article

A refinement of Kuratowski's theoremTHOMASSEN, C.Journal of combinatorial theory. Series B. 1984, Vol 37, Num 3, pp 245-253, issn 0095-8956Article

On the existence of specified cycles in a tournamentABDELHAMID BENHOCINE; WOJDA, A. P.Journal of graph theory. 1983, Vol 7, Num 4, pp 469-473, issn 0364-9024Article

Hypergraphs with no special cyclesANSTEE, R. P.Combinatorica (Print). 1983, Vol 3, Num 2, pp 141-146, issn 0209-9683Article

Knots and links in spatial graphsCONWAY, J. H; GORDON, C. MCA.Journal of graph theory. 1983, Vol 7, Num 4, pp 445-453, issn 0364-9024Article

LONG CYCLES IN DIAGRAPHSTHOMASSEN C.1981; PROC. LOND. MATH. SOC.; ISSN 0024-6115; GBR; DA. 1981; VOL. 42; NO 2; PP. 231-251; BIBL. 19 REF.Article

CIRCULANT GRAPH IMBEDDINGSPARSONS TD.1980; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1980; VOL. 29; NO 3; PP. 310-320; BIBL. 21 REF.Article