EVERY CONNECTED, LOCALLY CONNECTED GRAPH IS UPPER EMBEDDABLENEBESKY L.1981; J. GR. THEORY; ISSN 0364-9024; USA; DA. 1981; VOL. 5; NO 2; PP. 205-207; BIBL. 5 REF.Article

ON THE RADIUS OF GRAPHSHARANT J; WALTHER H.1981; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1981; VOL. 30; NO 1; PP. 113-117; BIBL. 3 REF.Article

ZUR STRUKTUR MINIMAL N-FACH ZUSAMMENHAENGEN DER GRAPHEN = STRUCTURE MINIMALE DE GRAPHES N-CONNEXESMADER W.1979; ABH. MATH. SEMINAR UNIV. HAMBURG; DEU; DA. 1979; VOL. 49; PP. 49-69; BIBL. 10 REF.Article

THE NUMBER OF 1-FACTORS IN 2K-CONNECTED GRAPHSBELLOBAS B.1978; J. COMBINATOR. THEORY, B; USA; DA. 1978; VOL. 25; NO 3; PP. 363-366; BIBL. 7 REF.Article

CONNEXITE DES ESPACES PREFERENCIESAURAY JP; BRISSAUD M; DURU G et al.1978; CAH. CENTRE ET. RECH. OPERAT.; BEL; DA. 1978; VOL. 20; NO 3-4; PP. 315-324; BIBL. 6 REF.Article

ON AN ALGORITHM OF HOPCROFT AND TARJAN: A NEW TRICONNECTIVITY ALGORITHMFONTET M.1978; PROBLEMES COMBINATOIRES ET THEORIE DES GRAPHES. CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE. COLLOQUE INTERNATIONAL. 260/1976/ORSAY; FRA; PARIS: CNRS; DA. 1978; PP. 141-144; ABS. FRE; BIBL. 5 REF.Conference Paper

SUR LES IMMERSIONS D'UN GRAPHE DANS LES SURFACES ORIENTABLES.NGUYEN HUY XUONG.1976; C.R. ACAD. SCI., A; FR.; DA. 1976; VOL. 283; NO 10; PP. 745-747; ABS. ANGL.; BIBL. 8 REF.Article

THE TRAIL NUMBER OF A GRAPHBOLLOBAS B; HARARY F.1982; NORTH-HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1982; VOL. 62; PP. 51-60; BIBL. 3 REF.Conference Paper

CONCEPT OF A VERTEX IN A MATROID AND 3-CONNECTED GRAPHSKELMANS AK.1980; J. GRAPH THEORY; USA; DA. 1980; VOL. 4; NO 1; PP. 13-19; BIBL. 5 REF.Article

GRAPHES DE NOMBRE FACIAL 3 OU 4PAYAN C; NGUYEN HUY XUONG.1980; ANN. DISCRETE MATH.; NLD; DA. 1980; VOL. 8; PP. 129-135; ABS. ENG; BIBL. 12 REF.Conference Paper

A SUFFICIENT CONDITION FOR GRAPHS WITH 1-FACTORSCHARTRAND G; GOLDSMITH DL; SCHUSTER S et al.1979; COLLOQ. MATH.; POL; DA. 1979; VOL. 41; NO 2; PP. 339-344; BIBL. 3 REF.Article

UNE CARACTERISATION CONSTRUCTIVE DES GRAPHES 2-ARETES-CONNEXES MINIMAUXCHATY CHEIN GM.1978; CAH. CENTRE ET. RECH. OPERAT.; BEL; DA. 1978; VOL. 20; NO 3-4; PP. 341-345; BIBL. 2 REF.Article

GENRE MAXIMAL ET CONNECTIVITE D'UN GRAPHE.JAEGER F; NGUYEN HUY XUONG; PAYAN C et al.1977; C.R. ACAD. SCI., A; FR.; DA. 1977; VOL. 285; NO 5; PP. 337-339; ABS. ANGL.; BIBL. 8 REF.Article

ECCENTRIC SEQUENCES AND ECCENTRIC SETS IN GRAPHS.BEHZAD M; SIMPSON JE.1976; DISCRETE MATH.; NETHERL.; DA. 1976; VOL. 16; NO 3; PP. 187-193; BIBL. 7 REF.Article

ON THE EXISTENCE OF A 3-CONNECTED 3-FACTOR IN POWERS OF A CONNECTED GRAPH.NEBESKY L.1976; IN: GRAPHS HYPERGRAPHS BLOCK SYST. SYMP. COMB. ANAL. PROC.; ZIELONA GORA; 1976; ZIELONA GORA; DA. 1976; PP. 167-172; BIBL. 6 REF.Conference Paper

MINIMALLY 2-EDGE-CONNECTED GRAPHSMAURER SB; SLATER PJ.1979; ANN. NEW YORK ACAD. SCI.; USA; DA. 1979-05; VOL. 319; PP. 377-382; BIBL. 6 REF.Conference Paper

MINIMUM BROADCAST GRAPHSFARLEY A; HEDETNIEMI S; MITCHELL S et al.1979; DISCRETE MATH.; NLD; DA. 1979; VOL. 25; NO 2; PP. 189-193; BIBL. 7 REF.Article

CARACTERISATION DES GRAPHES DE NOMBRE FACIAL 3 OU 4PAYAN C; NGUYEN HUY XUONG.1979; MATH. APPL. INFORMAT., RAPP. RECH.; FRA; DA. 1979; NO 159; 32 P.; BIBL. 11 REF.Serial Issue

LINK DESIGNS AND PROBABILITY ANALYSES FOR A CLASS OF CONNECTING NETWORKSHWANG FK.1978; NETWORKS; USA; DA. 1978; VOL. 8; NO 4; PP. 287-296; BIBL. 4 REF.Article

MINIMALLY LOCALLY 1-CONNECTED GRAPHSKULKARNI KH.1978; BULL. AUSTRAL. MATH. SOC.; AUS; DA. 1978; VOL. 19; NO 1; PP. 77-80; BIBL. 4 REF.Article

SOLDERING AND POINT SPLITTING.SLATER PJ.1978; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1978; VOL. 24; NO 3; PP. 338-343; BIBL. 6 REF.Article

A SHORT PROOF OF CATLIN'S EXTENSION OF BROOK'S THEOREM.MITCHEM J.1978; DISCRETE MATH.; NETHERL.; DA. 1978; VOL. 21; NO 2; PP. 213-214; BIBL. 3 REF.Article

MEAN DISTANCE IN A GRAPH.DOYLE JK; GRAVER JE.1977; DISCRETE MATH.; NETHERL.; DA. 1977; VOL. 17; NO 2; PP. 147-154; BIBL. 1 REF.Article

ON KERNELS IN STRONGLY CONNECTED GRAPHS.ANCIAUX MUNDELESER M; HANSEN P.1977; NETWORKS; U.S.A.; DA. 1977; VOL. 7; NO 3; PP. 263-266; BIBL. 4 REF.Article

Page / 79