Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:(%22NON DIRECTED GRAPH%22)

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 110879

  • Page / 4436
Export

Selection :

  • and

FINDING THE VERTEX CONNECTIVITY OF GRAPHSGALIL Z.1980; S.I.A.M. J. COMPUTG; USA; DA. 1980; VOL. 9; NO 1; PP. 197-199; BIBL. 6 REF.Article

SUR LA NOTION D'ADJOINT AUX GRAPHES ORIENTES ET AUX GRAPHES NON ORIENTESCHIAPPA PA.1979; R. C. MAT.; ITA; DA. 1979; VOL. 12; NO 1; PP. 85-104; ABS. ENG; BIBL. 37 REF.Article

COMPUTING EXTREMAL AND APPROXIMATE DISTANCES IN GRAPHS HAVING UNIT COST EDGESBOOTH KS; LIPTON RJ.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 15; NO 4; PP. 319-328; BIBL. 8 REF.Article

ACYCLIC AND TOTALLY CYCLIC ORIENTATIONS OF COMBINATORIAL GEOMETRIES.LAS VERGNAS M.1977; DISCRETE MATH.; NETHERL.; DA. 1977; VOL. 20; NO 1; PP. 51-61; BIBL. 17 REF.Article

TWO-COMMODITY FLOWITAI A.1978; J. ASS. COMPUTG MACHIR.; USA; DA. 1978; VOL. 25; NO 4; PP. 596-611; BIBL. 14 REF.Article

A SIMPLE TECHNIQUE FOR COMPUTING NETWORK RELIABILITY = UNE TECHNIQUE SIMPLE POUR LE CALCUL DE LA FIABILITE D'UN RESEAUAHMAD SH.1982; IEEE TRANS. RELIAB.; ISSN 0018-9529; USA; DA. 1982; VOL. 31; NO 1; PP. 41-44; BIBL. 6 REF.Article

SEQUENTIAL EVALUATION OF TERMINAL PAIR RELIABILITY IN A RELIABILITY NETWORKSANTOSH KUMAR.1982; MICROELECTRON. RELIAB.; ISSN 0026-2714; GBR; DA. 1982; VOL. 22; NO 2; PP. 151-162; BIBL. 15 REF.Article

CONNECTION DIGRAPHS AND SECOND- ORDER LINE DIGRAPHSBEINEKE LW; ZAMFIRESCU CM.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 39; NO 3; PP. 237-254; BIBL. 7 REF.Article

SUR UNE METHODE DE SEPARATION DES BICOMPOSANTES DANS LES GRAPHES ORIENTES SATURESBELKIN AR.1982; ZURNAL VYCISLITEL'NOJ MATEMATIKI I MATEMATICESKOJ FIZIKI; ISSN 0044-4669; SUN; DA. 1982; VOL. 22; NO 6; PP. 1518-1521; BIBL. 3 REF.Article

DISTANCE TRANSITIVE DIGRAPHSLAM CWH.1980; DISCRETE MATH.; NLD; DA. 1980; VOL. 29; NO 3; PP. 265-274; BIBL. 5 REF.Article

GRAPHS WITH AN EXTREMAL NUMBER OF SPANNING TREESKELMANS AK.1980; J. GRAPH THEORY; USA; DA. 1980; VOL. 4; NO 1; PP. 119-122; BIBL. 5 REF.Article

OPTIMALE PROGRAMME FUER MULTISTROEME AUF ENDLICHEN GERICHTETEN GRAPHEN = PROGRAMMES OPTIMAUX POUR DES MULTICOURANTS SUR DES GRAPHES ORIENTES FINISWALK M.1980; WISSENSCH. Z. FRIEDRICH.-SCHILLER-UNIV. JENA, MATH.-NATURWISSENSCH. REIHE; DDR; DA. 1980; VOL. 29; NO 2; PP. 319-325; ABS. RUS/ENG; BIBL. 6 REF.Article

BIGRAPHS VERSUS DIGRAPHS VIA MATRICESBRUALDI RA; HARARY F; MILLER Z et al.1980; J. GRAPH THEORY; USA; DA. 1980; VOL. 4; NO 1; PP. 51-73; BIBL. 24 REF.Article

ON CERTAIN VECTOR SPACES ASSOCIATED TO THE ORIENTED FINITE GRAPHSMARCU D.1979; AN. STI. UNIV. "AL. I. CUZA", 1A; ROM; DA. 1979; VOL. 25; NO 1; PP. 175-181; BIBL. 4 REF.Article

SUR LES COLORATIONS DES GRAPHES ORIENTESSPERANZA F.1979; BOLL. UN. MAT. ITAL.; ITA; DA. 1979; VOL. 16A; NO 3; PP. 517-522; ABS. ITA; BIBL. 4 REF.Article

ON DOMINATION AND INDEPENDENT DOMINATION NUMBERS OF A GRAPH.ALLAN RB; LASKAR R.1978; DISCRETE MATH.; NLD; DA. 1978; VOL. 33; NO 2; PP. 73-76; BIBL. 6 REF.Article

FORMULAE FOR THE NUMBER OF SPARSELY-EDGED STRONG LABELLED DIGRAPHS.WRIGHT EM.1977; QUART. J. MATH.; G.B.; DA. 1977; VOL. 28; NO 111; PP. 363-367; BIBL. 3 REF.Article

WHICH DIRECTED GRAPHS HAVE A SOLUTION.BEHZAD M; HARARY F.1977; MATH. SLOV.; TCHECOSL.; DA. 1977; VOL. 27; NO 1; PP. 37-42; ABS. RUSSE; BIBL. 11 REF.Article

DECOMPOSITION OF THE COMPLETE DIRECTED GRAPH INTO K-CIRCUITS.BERMOND JC; FABER V.1976; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1976; VOL. 21; NO 2; PP. 146-155; BIBL. 17 REF.Article

INFINITE DIGRAPHS ISOMORPHIC WITH THEIR LINE DIGRAPHS.BEINEKE LW; HEMMINGER RL.1976; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1976; VOL. 21; NO 3; PP. 244-256; BIBL. 4 REF.Article

A NOTE ON REMOVING A POINT OF A STRONG DIGRAPHHORAK P.1983; MATH. SLOV.; ISSN 0139-9918; CSK; DA. 1983; VOL. 33; NO 1; PP. 85-86; ABS. RUS; BIBL. 6 REF.Article

THE CONJUNCTION OF CAYLEY DIGRAPHSKEATING K.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 42; NO 2-3; PP. 209-219; BIBL. 8 REF.Article

A NOTE ON THE GIRTH OF DIGRAPHSHAMIDOUNE YO.1982; COMBINATORICA (BP., 1981); ISSN 0209-9683; HUN; DA. 1982; VOL. 2; NO 2; PP. 143-147; BIBL. 10 REF.Article

COUNTABLE ULTRAHOMOGENEOUS UNDIRECTED GRAPHSLACHLAN AH; WOODROW RE.1980; TRANS. AM. MATH. SOC.; ISSN 0002-9947; USA; DA. 1980; VOL. 262; NO 1; PP. 51-94; BIBL. 8 REF.Article

DIGRAPHS WITH REAL AND GAUSSIAN SPECTRAESSER F; HARARY F.1980; DISCRETE APPL. MATH.; NLD; DA. 1980; VOL. 2; NO 2; PP. 113-124; BIBL. 14 REF.Article

  • Page / 4436