Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Cycle graphe")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1365

  • Page / 55
Export

Selection :

  • and

Longest cycles in triangle-free graphsMIN AUNG.Journal of combinatorial theory. Series B. 1989, Vol 47, Num 2, pp 171-186, issn 0095-8956, 16 p.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

Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorableYINGQIAN WANG; MING CHEN; LIANG SHEN et al.Discrete mathematics. 2008, Vol 308, Num 17, pp 4014-4017, issn 0012-365X, 4 p.Article

The crossing number of P(3, 1)×PnPENG, Y. H; YIEW, Y. C.Discrete mathematics. 2006, Vol 306, Num 16, pp 1941-1946, issn 0012-365X, 6 p.Article

Cycles of length 1 modulo 3 in graphLU MEI; YU ZHENGGUANG.Discrete applied mathematics. 2001, Vol 113, Num 2-3, pp 329-336, issn 0166-218XArticle

The longest cycles in a graph G with minimum degree at least |G|/kEGAWA, Y; MIYAMOTO, T.Journal of combinatorial theory. Series B. 1989, Vol 46, Num 3, pp 356-362, issn 0095-8956Article

Distance-regular graphs with girth 3 or 4:1TERWILLIGER, P.Journal of combinatorial theory. Series B. 1985, Vol 39, Num 3, pp 265-281, issn 0095-8956Article

Long cycles in bipartite graphsJACKSON, B.Journal of combinatorial theory. Series B. 1985, Vol 38, Num 2, pp 118-131, issn 0095-8956Article

Cycles through k+2 vertices in k-connected graphsTSIKOPOULOS, N.Discrete mathematics. 1984, Vol 50, Num 1, pp 113-114, issn 0012-365XArticle

Cycles through ten vertices in 3-connected cubic graphsELLINGHAM, M. N; HOLTON, D. A; LITTLE, C. H. C et al.Combinatorica (Print). 1984, Vol 4, Num 4, pp 265-273, issn 0209-9683Article

Shortest coverings of graphs with cyclesBERMOND, J. C; JACKSON, B; JAEGER, F et al.Journal of combinatorial theory. Series B. 1983, Vol 35, Num 3, pp 297-308, issn 0095-8956Article

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

Bridges of longest cyclesZHANG, C.-Q.Discrete mathematics. 1989, Vol 78, Num 1-2, pp 195-211, issn 0012-365X, 17 p.Article

  • Page / 55