THE K-CONNECTEDNESS OF BIPARTITE GRAPHSWRIGHT EM.1982; J. LOND. MATH. SOC.; ISSN 0024-6107; GBR; DA. 1982; VOL. 25; NO 1; PP. 7-12; BIBL. 9 REF.Article

A CHARACTERIZATION OF 3-CONNECTED GRAPHS CONTAINING A GIVEN GRAPHNEGAMI S.1982; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1982; VOL. 32; NO 1; PP. 69-74; BIBL. 3 REF.Article

WHEN M VERTICES IN A K-CONNECTED GRAPH CANNOT BE WALKED ROUND ALONG A SIMPLE CYCLEKELMANS AK; LOMONOSOV MV.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 38; NO 2-3; PP. 317-322; BIBL. 7 REF.Article

ON CROSS-BANDWIDTHKAHN J; KLEITMAN DJ.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 33; NO 3; PP. 323-325; BIBL. 3 REF.Article

RECONSTRUCTING THE N-CONNECTED COMPONENTS OF A GRAPHGREENWELL DL; HEMMINGER RL.1973; AEQUATIONES MATH.; SUISSE; DA. 1973; VOL. 9; NO 1; PP. 19-22; BIBL. 5 REF.Serial Issue

RELATIVE LENGTHS OF PATHS AND CYCLES IN K-CONNECTED GRAPHSLOCKE SC.1982; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1982; VOL. 32; NO 2; PP. 206-222; BIBL. 4 REF.Article

A SHORTNESS EXPONENT FOR R-REGULAR R-CONNECTED GRAPHSJACKSON B; PARSONS TD.1982; J. GR. THEORY; ISSN 0364-9024; USA; DA. 1982; VOL. 6; NO 2; PP. 169-176; BIBL. 7 REF.Article

REGULAR N-VALENT N-CONNECTED NONHAMILTONIAN NON-N-EDGE-COLORABLE GRAPHSMEREDITH GHJ.1973; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1973; VOL. 14; NO 1; PP. 55-60; BIBL. 3 REF.Serial Issue

CIRCUITS THROUGH SPECIFIED EDGESHAGGKVIST R; THOMASSEN C.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 41; NO 1; PP. 29-34; BIBL. 14 REF.Article

SPANNING SUBGRAPHS OF K-CONNECTED DIGRAPHSMARCUS DA.1981; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1981; VOL. 30; NO 1; PP. 21-31; BIBL. 3 REF.Article

CONTRACTION THEOREMS IN HAMILTONIAN GRAPH THEORYHOEDE C; VELDMAN HJ.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 34; NO 1; PP. 61-67; BIBL. 9 REF.Article

PRESQUE TOUS LES GRAPHES SONT K-CONNEXESTOMESCU I.1980; REV. ROUM. MATH. PURES APPL.; ISSN 0035-3965; ROM; DA. 1980; VOL. 25; NO 7; PP. 1125-1130; BIBL. 3 REF.Article

COUNTING NON-ISOMORPHIC THREE-CONNECTED PLANAR MAPSWALSH TRS.1982; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1982; VOL. 32; NO 1; PP. 33-44; BIBL. 14 REF.Article

CONTRIBUTION A L'ETUDE DE LA CONNECTIVITE D'UN GRAPHEMOHAMEDOU YAHYA OULD ELMOCTAR.1980; ; FRA; DA. 1980; 117 P.: ILL.; 21 CM; BIBL. DISSEM.; TH.: SCI. MATH./PARIS 6/1980Thesis

Minimal n-fach zusammenhängende Digraphen = Graphe orienté minimalement n-connexe = Minimally n-connected digraphMADER, W.Journal of combinatorial theory. Series B. 1985, Vol 38, Num 2, pp 102-117, issn 0095-8956Article

Fragments in 2-critically n-connected graphsJIANJI SU.Journal of combinatorial theory. Series B. 1993, Vol 58, Num 2, pp 269-279, issn 0095-8956Article

On locally k-critically n-connected graphsJIANJI SU.Discrete mathematics. 1993, Vol 120, Num 1-3, pp 183-190, issn 0012-365XArticle