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

DENSE NEIGHBOURHOODS AND TURAN'S THEOREMBOLLOBAS B; THOMASON A.1981; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1981; VOL. 31; NO 1; PP. 111-114; BIBL. 5 REF.Article

FIXED-EDGE THEOREM FOR GRAPHS WITH LOOPSNOWAKOWSKI R; RIVAL I.1979; J. GRAPH THEORY; USA; DA. 1979; VOL. 3; NO 4; PP. 339-350; BIBL. 1 REF.Article

ON THE MAXIMUM EDGES OF A HEREDITARY HYPERGRAPHCROITORU C.1980; AN. STI. UNIV. "AL. I. CUZA" IASI, 1A; ROM; DA. 1980; VOL. 26; NO 1; PP. 179-184; BIBL. 4 REF.Article

FURTHER REMARKS ON PARTITIONING THE EDGES OF A GRAPH.HILTON AJW; JONES RP.1978; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1978; VOL. 24; NO 2; PP. 249-250; BIBL. 2 REF.Article

ON UNIMODAL SEQUENCES OF GRAPHICAL INVARIANTSSCHWENK AJ.1981; J. COMP. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1981; VOL. 30; NO 2; PP. 247-250; BIBL. 7 REF.Article

MINIMAL SEPARATING SETS OF MAXIMUM SIZEALAVI Y; NEHZAD M; NORDHAUS EA et al.1980; J. COMBINATOR. THEORY, B; USA; DA. 1980; VOL. 28; NO 2; PP. 180-183; BIBL. 6 REF.Article

ON GRAPHS WHICH CONTAIN ALL SMALL TREES.CHUNG FRK; GRAHAM RL.1978; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1978; VOL. 24; NO 1; PP. 14-23; BIBL. 10 REF.Article

ON GRAPHS WITHOUT ANTIDIRECTED ELEMENTARY CYCLES AND RELATED TOPICSJAEGER F; PAYAN C.1978; MATH. APPL. INFORMAT., RAPP. RECH.; FRA; DA. 1978; NO 135; PP. 1-7; BIBL. 7 REF.Serial Issue

EDGE PARTITIONS OF COMPLETE MULTIPARTITE GRAPHS INTO EQUAL LENGTH CIRCUITS.COCKAYNE EJ; HARTNELL BL.1977; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1977; VOL. 23; NO 2-3; PP. 174-183; BIBL. 9 REF.Article

GENERALISATION DU THEOREME DE TURANKOPYLOV GN.1979; MAT. ZAMET.; SUN; DA. 1979; VOL. 26; NO 4; PP. 593-602; BIBL. 7 REF.Article

PARTITIONING THE EDGES OF A GRAPHHILTON AJW; JONES RP.1978; J. COMBINATOR. THEORY, B; USA; DA. 1978; VOL. 25; NO 3; PP. 290-294; BIBL. 4 REF.Article

ON A PROBLEM IN EXTREMAL GRAPH THEORY.BUSOLINI DT; ERDOS P.1977; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1977; VOL. 23; NO 2-3; PP. 251-254; BIBL. 3 REF.Article

EDGE COSYMMETRIC GRAPHSBURNS D; KAPOOR SF; OSTRAND PA et al.1980; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1980; VOL. 32; NO 2; PP. 99-103; BIBL. 8 REF.Article

FORMULATION DICHOTOMIQUE DU PROBLEME DE MINIMISATION DU NOMBRE D'INTERSECTIONS DES ARETES D'UN GRAPHEMAKAROV LI.1977; VYCHISLIT. SIST.; SUN; DA. 1977; NO 69; PP. 40-47; BIBL. 3 REF.Article

HYPERGRAPHES CRITIQUES AVEC UN NOMBRE MINIMAL D'ARETESBURSHTEJN MI.1976; SOOBSHCH. AKAD. NAUK GRUZ. S.S.R.; S.S.S.R.; DA. 1976; VOL. 83; NO 2; PP. 285-288; ABS. GEORGIEN ANGL.; BIBL. 8 REF.Article

SUI VERTICI E SUGLI SPIGOLI QUASI CRITICI DI UN GRAFO. = SUR LES NOEUDS ET LES COTES QUASI CRITIQUES D'UN GRAPHEDE FLORA A.1975; RIV. MAT. UNIV. PARMA; ITAL.; DA. 1975 PARU 1977; VOL. 4; NO 1; PP. 233-237; ABS. ANGL.; BIBL. 2 REF.Article

EINE REDUKTIONSMETHODE FUER DEN KANTENZUSAMMENHANG IN GRAPHEN = UNE METHODE DE REDUCTION POUR LA CONNECTIVITE D'ARETES DANS DES GRAPHESMADER W.1979; MATH. NACHR.; DDR; DA. 1979; VOL. 93; PP. 187-204; BIBL. 11 REF.Article

LE NOMBRE MAXIMAL DE COLORIAGES DES ARETES D'UN GRAPHETOMESCU I.1979; REV. ROUMAINE MATH. PURES APPL.; ROM; DA. 1979; VOL. 24; NO 5; PP. 811-816; BIBL. 7 REF.Article

PARALLEL SORTING WITH CONSTANT TIME FOR COMPARISONSHAEGGKVIST R; HELL P.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 3; PP. 465-472; BIBL. 9 REF.Article

SENSITIVITAETSINDICES FUER KNOTEN UND KANTEN EINES NETZES = INDICES DE SENSIBILITE POUR LES NOEUDS ET LES ARETES D'UN RESEAULOHSE D.1980; O.R. SPEKTRUM; DEU; DA. 1980; VOL. 1; NO 4; PP. 261-264; ABS. ENG; BIBL. 6 REF.Article

NOMBRE DE TRIANGLES DANS QUELQUES GRAPHESKHADZHIVANOV NG.1979; SERDICA; BGR; DA. 1979; VOL. 5; NO 2; PP. 103-118; BIBL. 5 REF.Article

UNIQUENESS OF COLORINGS.DE WERRA D.1977; ARCH. MATH.; DTSCH.; DA. 1977; VOL. 28; NO 3; PP. 330-336; BIBL. 7 REF.Article

OPTIMUM ADDITION OF AN EDGE TO A PATHCOCKAYNE EJ; MILLER DJ.1980; I.E.E.E. TRANS. CIRCUITS SYST.; USA; DA. 1980; VOL. 27; NO 7; PP. 649-651; BIBL. 2 REF.Article

THE EDGE INDUCIBILITY OF GRAPHSGOLUMBIC MC; PERL Y.1980; ACTA MATH. ACAD. SCI. HUNG.; ISSN 0001-5954; HUN; DA. 1980; VOL. 35; NO 3-4; PP. 393-398; BIBL. 6 REF.Article