UEBER N-FACH ZUSAMMENHAENGENDE ECKENMENGEN IN GRAPHEN. = SUR DES ENSEMBLES DE NOEUDS N-CONNEXES DANS DES GRAPHESMADER W.1978; J. COMBINATOR THEORY; USA; DA. 1978; VOL. 25; NO 1; PP. 74-93; ABS. ENG; BIBL. 15 REF.Article

A COUNTEREXAMPLE TO A CONJECTURE ON PATHS OF BOUNDED LENGTHBOYLES SM; EXOO G.1982; J. GR. THEORY; ISSN 0364-9024; USA; DA. 1982; VOL. 6; NO 2; PP. 205-209; BIBL. 5 REF.Article

On matroids of the greatest W-connectivityWEIXUAN, L.Journal of combinatorial theory. Series B. 1983, Vol 35, Num 1, pp 20-27, issn 0095-8956Article

Partition of graphs with condition on the connectivity and minimum degreeHAJNAL, P.Combinatorica (Print). 1983, Vol 3, Num 1, pp 95-99, issn 0209-9683Article

On several sorts of connectivityPEROCHE, B.Discrete mathematics. 1983, Vol 46, Num 3, pp 267-277, issn 0012-365XArticle

A TOPOLOGY FOR AUTOMATA: A NOTE.SHUKLA W; SRIVASTAVA AK.1976; INFORM. AND CONTROL; U.S.A.; DA. 1976; VOL. 32; NO 2; PP. 163-168; BIBL. 7 REF.Article

A critica view of pyramid segmentation algorithmsBISTER, M; CORNELIS, J; ROSENFELD, A et al.Pattern recognition letters. 1990, Vol 11, Num 9, pp 605-617, issn 0167-8655, 13 p.Article

CONVEXITE DES FONCTIONS DE DENSITE: APPLICATION A LA DETECTION DES MODES EN RECONNAISSANCE DES FORMESVASSEUR C; POSTAIRE JG.1979; R.A.I.R.O., AUTOMAT.; FRA; DA. 1979; VOL. 13; NO 2; PP. 171-188; ABS. ENG; BIBL. 12 REF.Article

Elementary properties of arcwise connected sets and functionsSINGH, C.Journal of optimization theory and applications. 1983, Vol 41, Num 2, pp 377-387, issn 0022-3239Article

THE CONNECTIVITIES OF A GRAPH AND ITS COMPLEMENTTINDELL R.1982; NORTH-HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1982; VOL. 62; PP. 191-201; BIBL. 5 REF.Conference Paper

THE CONNECTIVITIES OF LINE AND TOTAL GRAPHSBAUER D; TINDELL R.1982; J. GR. THEORY; ISSN 0364-9024; USA; DA. 1982; VOL. 6; NO 2; PP. 197-203; BIBL. 7 REF.Article

ALGORITHMIC PROOFS OF TWO RELATIONS BETWEEN CONNECTIVITY AND THE 1-FACTORS OF A GRAPHGABOW HN.1979; DISCRETE MATH.; NLD; DA. 1979; VOL. 26; NO 1; PP. 33-40; BIBL. 7 REF.Article

A GENERALIZATION OF LINE CONNECTIVITY AND OPTIMALLY INVULNERABLE GRAPHS.BOESCH FT; CHEN S.1978; S.I.A.M. J. APPL. MATH.; USA; DA. 1978; VOL. 34; NO 4; PP. 657-665; BIBL. 13 REF.Article

Pendant tree-connectivityHAGER, M.Journal of combinatorial theory. Series B. 1985, Vol 38, Num 2, pp 178-189, issn 0095-8956Article

k-connectivity in random undirected graphsREIF, J. H; SPIRAKIS, P. G.Discrete mathematics. 1985, Vol 54, Num 2, pp 181-191, issn 0012-365XArticle

A SIMPLE THEOREM ON 3-CONNECTIVITYBIXBY RE.1982; LINEAR ALGEBRA & APPL.; ISSN 0024-3795; USA; DA. 1982; VOL. 45; PP. 123-126; BIBL. 3 REF.Article

INDESTRUCTIVE DELETIONS OF EDGES FROM GRAPHSBOLLOBAS B; GOLDSMITH DL; WOODALL DR et al.1981; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1981; VOL. 30; NO 3; PP. 263-275; BIBL. 12 REF.Article

Some recent results on niche graphsBOWSER, S; CABLE, C. A.Discrete applied mathematics. 1991, Vol 30, Num 2-3, pp 101-108, issn 0166-218X, 8 p.Article

Réseaux systoliques pour le calcul des composantes connexes et la triangularisation des matrices bandes = Systolic array for calculating connected component and band matrix triangularizationTCHUENTE, M; MELKEMI, L.Rapport de recherche - IMAG. 1983, Num 366, issn 0750-7380, 9 p.Report

THE ASYMPTOTIC CONNECTIVITY OF LABELLED REGULAR GRAPHSWORMALD NC.1981; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1981; VOL. 31; NO 2; PP. 156-167; BIBL. 8 REF.Article

THE R-CONNECTEDNESS OF K-PARTITE RANDOM GRAPHRUCINSKI A.1981; BULL. ACAD. POL. SCI., SER. SCI. MATH.; ISSN 0137-639X; POL; DA. 1981; VOL. 29; NO 7-8; PP. 321-330; ABS. RUS; BIBL. 13 REF.Article

QUELQUES PROBLEMES DE CONNEXITE DANS LES GRAPHES ORIENTESYAHYA OULD HAMIDOUNE.1981; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1981; VOL. 30; NO 1; PP. 1-10; ABS. ENG; BIBL. 8 REF.Article

Comments on «detection of connectivity for regions represented by linear quadtrees»ABEL, D. J.Computers & mathematics with applications. 1984, Vol 10, Num 2, pp 167-170, issn 0097-4943Article

ON CONNECTIVITY IN MATROIDS AND GRAPHSOXLEY JG.1981; TRANS. AM. MATH. SOC.; ISSN 0002-9947; USA; DA. 1981; VOL. 265; NO 1; PP. 47-58; BIBL. 25 REF.Article

EDGE-DISJOINT BRANCHING IN DIRECTED MULTIGRAPHSSHILOACH Y.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 1; PP. 24-27; BIBL. 10 REF.Article