Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("GRAPHE 4-CONNEXE")

Results 1 to 7 of 7

  • Page / 1
Export

Selection :

  • and

UNCONTRACTABLE 4-CONNECTED GRAPHSMARTINOV N.1982; J. GR. THEORY; ISSN 0364-9024; USA; DA. 1982; VOL. 6; NO 3; PP. 343-344; BIBL. 5 REF.Article

A CLASSIFICATION OF 4-CONNECTED GRAPHS.SLATER PJ.1974; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1974; VOL. 17; NO 3; PP. 281-298; BIBL. 6 REF.Article

EDGE-RECONSTRUCTION OF 4-CONNECTED PLANAR GRAPHSFIORINI S; LAURI J.1982; J. GR. THEORY; ISSN 0364-9024; USA; DA. 1982; VOL. 6; NO 1; PP. 33-42; BIBL. 3 REF.Article

Long path connectivity of regular graphsCUN-QUAN ZHANG; YONG-JIN ZHU.Discrete mathematics. 1991, Vol 96, Num 2, pp 151-160, issn 0012-365XArticle

Extending matchings in planar graphs IVPLUMMER, M. D.Discrete mathematics. 1992, Vol 109, Num 1-3, pp 207-219, issn 0012-365XArticle

The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphsCHIBA, N; NISHIZEKI, T.Journal of algorithms (Print). 1989, Vol 10, Num 2, pp 187-211, issn 0196-6774, 25 p.Article

Typical subgraphs of 3- and 4-connected graphsOPOROWSKI, B; OXLEY, J; THOMAS, R et al.Journal of combinatorial theory. Series B. 1993, Vol 57, Num 2, pp 239-257, issn 0095-8956Article

  • Page / 1