Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("GRAPHE ORIENTE")

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

Results 1 to 25 of 2945

  • Page / 118
Export

Selection :

  • and

A NOTE ON NONISOMORPHIC COSPECTRAL DIGRAPHS.KRISHNAMOORTHY V; PARTHASARATHY KR.1974; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1974; VOL. 17; NO 1; PP. 39-40; BIBL. 1 REF.Article

ON SOME PROPERTIES OF N-TOURNAMENTS.TYAGI MS.1973; S.I.A.M. J. APPL. MATH.; U.S.A.; DA. 1973; VOL. 24; NO 2; PP. 207-214; BIBL. 4 REF.Article

AN ALGORITHM FOR R-BASES OF A DIRECTED GRAPH.BROWN JR.1976; NETWORKS; U.S.A.; DA. 1976; VOL. 6; NO 2; PP. 185-188; BIBL. 5 REF.Article

ON SPARSE GRAPHS WITH DENSE LONG PATHS.ERDOES P; GRAHAM RL; SZEMEREDI E et al.1975; COMPUTERS MATH. APPL.; G.B.; DA. 1975; VOL. 1; NO 3-4; PP. 365-369; BIBL. 4 REF.Article

ARBITRARILY TRACEABLE GRAPHS AND DIGRAPHS.ERICKSON DB.1975; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1975; VOL. 19; NO 1; PP. 5-23; BIBL. 9 REF.Article

DIGRAPHS AND THE CONSTRUCTION OF GROUPS WITH SPECIFIED AUTOMORPHISM GROUP.LIEBECK H.1976; IN: BR. COMB. CONF. 5. PROC.; ABERDEEN; 1975; WINNIPEG; UTILITAS MATHEMATICA; DA. 1976; PP. 405-410; BIBL. 8 REF.Conference Paper

ON THE NUMBER OF CYCLICALLY DISTINCT BINARY SEQUENCES HAVING NON INTERNAL PERIODICITY AND SATISFYING CERTAIN EQUALITY CONSTRAINTS.CHRISTENSEN J; BRYANT PR.1976; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1976; VOL. 20; NO 2; PP. 171-184; BIBL. 5 REF.Article

TRANSVERSALS OF CIRCUITS IN THE LEXICOGRAPHIC PRODUCT OF DIRECTED GRAPHS.THOMASSEN C.1975; MATH. SCI. HUM.; FR.; DA. 1975; NO 51; PP. 43-45; BIBL. 2 REF.Article

ON THE ACYCLICITY OF SINGLE-SOURCE SINGLE-SINK PLANAR DIGRAPHSOZAWA T; OHTA H.1982; TRANSACTIONS OF THE INSTITUTE OF ELECTRONICS AND COMMUNICATION ENGINEERS OF JAPAN. SECTION E; ISSN 0387-236X; JPN; DA. 1982; VOL. 65; NO 12; PP. 756-757; BIBL. 3 REF.Article

DETOURS IN DIGRAPHSENTRINGER RC; JACKSON DE; SWART E et al.1981; SOUTHEASTERN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND COMPUTING. 12/1981/LOUISIANA STATE UNIVERSITY LA; CAN; WINNIPEG: UTILITAS MATHEMATICA PUBLISHING; DA. 1981; PP. 305-321; BIBL. 5 REF.Conference Paper

ON RECONSTRUCTING SEPARABLE DIGRAPHSRAMACHANDRAN S.1981; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1981; NO 885; PP. 406-409; BIBL. 7 REF.Conference Paper

ORIENTED TWO-DIMENSIONAL CIRCUITSDEWDNEY AK; HARARY F.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 33; NO 2; PP. 149-162; BIBL. 4 REF.Article

THE SEARCH FOR LONG PATHS AND CYCLES IN VERTEX-TRANSITIVE GRAPHS AND DIGRAPHSALSPACH B.1981; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1981; NO 884; PP. 14-22; BIBL. 26 REF.Conference Paper

A PROPERTY OF A-FRAGMENTS OF A DIGRAPHHAMIDOUNE YO.1980; DISCRETE MATH.; NLD; DA. 1980; VOL. 31; NO 1; PP. 105-106; BIBL. 4 REF.Article

CONSENSUS SIGNED DIGRAPHSWEEKS JR; BOGART KP.1979; S.I.A.M. J. APPL. MATH.; USA; DA. 1979; VOL. 36; NO 1; PP. 1-14; BIBL. 11 REF.Article

A NOTE ON FINDING OPTIMUM BRANCHINGSCAMERINI PM; FRATTA L; MAFFIOLI F et al.1979; NETWORKS; USA; DA. 1979; VOL. 9; NO 4; PP. 309-312; BIBL. 9 REF.Article

GENERALIZED CONNECTORSPIPPENGER N.1978; S.I.A.M. J. COMPUTG; USA; DA. 1978; VOL. 7; NO 4; PP. 510-514; BIBL. 6 REF.Article

ASYMPTOTIC FORMULAS FOR THE NUMBER OF ORIENTED GRAPHS.WRIGHT EM.1978; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1978; VOL. 24; NO 3; PP. 370-373; BIBL. 3 REF.Article

A NEW ALGORITHM FOR DIGRAPH ISOMORPHISM.NARSINGH DEO; DAVIS JM; LORD RE et al.1977; B.I.T.; DANM.; DA. 1977; VOL. 17; NO 1; PP. 16-30; BIBL. 19 REF.Article

AUTOMORPHISMS AND COHOMOLOGY OF SWITCHING CLASSES.CAMERON PJ.1977; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1977; VOL. 22; NO 3; PP. 297-298; BIBL. 1 REF.Article

ON CERTAIN SUBGRAPHS OF A COMPLETE TRANSITIVELY DIRECTED GRAPH.ANDERSEN E; KJELDSEN K.1976; DISCRETE MATH.; NETHERL.; DA. 1976; VOL. 14; NO 2; PP. 103-119; BIBL. 1 REF.Article

COMPUTATIONAL EXPERIENCES WITH SOME TRANSITIVE CLOSURE ALGORITHMS.SYSLO MM; DZIKIEWICZ J.1975; COMPUTING; AUSTR.; DA. 1975; VOL. 15; NO 1; PP. 33-39; ABS. ALLEM.; BIBL. 18 REF.Article

ON J-PANCYCLIC GRAPHS.JACOS V.1975; MAT. CAS.; CESKOSL.; DA. 1975; VOL. 25; NO 3; PP. 281-286; BIBL. 2 REF.Article

ON MAXIMAL CIRCUITS IN DIRECTED GRAPHS.LEWIN M.1975; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1975; VOL. 18; NO 2; PP. 175-179; BIBL. 6 REF.Article

ON THE MAXIMAL ORDER OF CYCLICITY OF ANTISYMMETRIC DIRECTED GRAPHS.KOTZIG A.1975; DISCRETE MATH.; NETHERL.; DA. 1975; VOL. 12; NO 1; PP. 17-25; BIBL. 3 REF.Article

  • Page / 118