ON DISTANCE ANALYSIS AND COMPLETE DAMAGE OF A COMMUNICATION GRAPHNIEMINEN J.1972; REV. ROUMAINE SCI. TECH., ELECTROTECH. ENERGET.; ROUMAN.; DA. 1972; VOL. 17; NO 4; PP. 691-696; ABS. FR. ALLEM. RUSSE; BIBL. 1 REF.Serial Issue

EIN ORDNUNGSBEGRIFF FUER GRAPHEN OHNE UNENDLICHE WEGE MIT EINER ANWENDUNG AUF N-FACH ZUSAMMENHAENGENDE GRAPHEN = UNE NOTION D'ORDRE POUR DES GRAPHES SANS CHEMIN INFINI AVEC UNE APPLICATION AUX GRAPHES CONNEXES N-PARTIESSCHMIDT R.1983; ARCHIV DER MATHEMATIK; ISSN 0003-889X; CHE; DA. 1983; VOL. 40; NO 3; PP. 283-288; BIBL. 3 REF.Article

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

STRUCTURE OF VERTEX-TRANSITIVE GRAPHS.GREEN AC.1975; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1975; VOL. 18; NO 1; PP. 1-11; BIBL. 8 REF.Article

A BIT-PUSHING SHORTEST DISTANCE ALGORITHM.ROSENTHAL A.1975; NETWORKS; U.S.A.; DA. 1975; VOL. 5; NO 4; PP. 301-305; BIBL. 2 REF.Article

A REMARK ON CONTRACTION OF GRAPHS WITH GIVEN GROUP.BABAI L.1974; ACTA MATH. ACAD. SCI. HUNGAR.; HONGR.; DA. 1974; VOL. 25; NO 1-2; PP. 89-91; BIBL. 5 REF.Article

ON THE SQUARES OF CYCLES AND OTHER GRAPHSDONGRE NM.1973; INDIAN J. PURE APPL. MATH.; INDIA; DA. 1973; VOL. 4; NO 1; PP. 1-4; BIBL. 2 REF.Serial Issue

EIN EXTREMALPROBLEM DES ZUSAMMENHANGS VON GRAPHEN = UN PROBLEME EXTREMAL DE LA CONNEXITE DES GRAPHESMADER W.1973; MATH. Z.; DTSCH.; DA. 1973; VOL. 131; NO 3; PP. 223-231; BIBL. 7 REF.Serial Issue

SUR LES P-CENTRES ABSOLUS D'UN GRAPHE. LA STABILITE DES P-CENTRES ABSOLUSHORVATH I.1973; REV. ANAL. NUMER. TEOR. APROXIM.; ROMAN.; DA. 1973; VOL. 2; NO 2; PP. 143-157; ABS. ANGL.; BIBL. 6 REF.Article

A NOTE ON GROWING BINARY TREESKONHEIM AG; NEWMAN DJ.1973; DISCRETE MATH.; NETHERL.; DA. 1973; VOL. 4; NO 1; PP. 57-63; BIBL. 3 REF.Serial Issue

A SURVEY OF CRITICALLY AND MINIMALLY N-CONNECTED AND N-LINE CONNECTED GRAPHS.LICK DR.1973; MATH. JAP.; JAP.; DA. 1973; VOL. 18; NO 2; PP. 99-106; BIBL. 10 REF.Article

ESTIMATING THE CONNECTIVITY OF A GRAPHCAPOBIANCO M.1972; LECTURE NOTES MATH.; GERM.; DA. 1972; NO 303; PP. 65-74; BIBL. 5 REF.Serial Issue

LINE GRAPHS OF TRIANGLELESS GRAPHS AND ITERATED CLIQUE GRAPHSHEDETNIEMI ST; SLATER PJ.1972; LECTURE NOTES MATH.; GERM.; DA. 1972; NO 303; PP. 139-147; BIBL. 11 REF.Serial Issue

SUR CERTAINS TOURNOISCHATY G.1972; REV. FR. INFORMAT. RECH. OPERAT., R; FR.; DA. 1972; VOL. 6; NO 1; PP. 27-36; BIBL. 7 REF.Serial Issue

THE NUMBER OF ROUNDS NEEDED TO EXCHANGE INFORMATION WITHIN A GRAPHASSMANN SF; KLEITMAN DJ.1983; DISCRETE APPLIED MATHEMATICS; ISSN 0166-218X; NLD; DA. 1983; VOL. 6; NO 2; PP. 117-125; BIBL. 10 REF.Article

REMARKS ON DISTANCES IN GRAPHSMELTER RA; TOMESCU I.1981; AN. STUENT. UNIV. "AL. I. CUZA" IASI, SECT. 1A; ISSN 0041-9109; ROM; DA. 1981; VOL. 27; NO 2; PP. 407-410; BIBL. 2 REF.Article

A CHARACTERIZATION OF UPPER-EMBEDDABLE GRAPHSJUNGERMAN M.1978; TRANS. AMER. MATH. SOC.; USA; DA. 1978; VOL. 241; PP. 401-406; BIBL. 7 REF.Article

ON TRIVALENT GRAPHS.GARDINER A.1975; J. LONDON MATH. SOC.; G.B.; DA. 1975; VOL. 10; NO 4; PP. 507-512; BIBL. 12 REF.Article

SUR LE NOMBRE DE CIRCUITS DANS UN TOURNOI FORTEMENT CONNEXE.LAS VERGNAS M.1975; CAH. CENTRE ET. RECH. OPERAT.; BELG.; DA. 1975; VOL. 17; NO 2-4; PP. 261-265; BIBL. 5 REF.; (COLLOQ. THEOR. GRAPHES; PARIS; 1974)Conference Paper