Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("CIRCUIT GRAPHE")

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 177

  • Page / 8
Export

Selection :

  • and

ANTIPODAL EMBEDDINGS OF GRAPHS.FARZAN M; WALLER DA.1977; J. LONDON MATH. SOC.; G.B.; DA. 1977; VOL. 15; NO 3; PP. 377-383; BIBL. 7 REF.Article

LABELLED AND UNLABELLED HAMILTONIAN CIRCUITS IN A CLASS OF 3-POLYTOPES.HILL A; SINGMASTER D.1976; IN: BR. COMB. CONF. 5. PROC.; ABERDEEN; 1975; WINNIPEG; UTILITAS MATHEMATICA; DA. 1976; PP. 293-305; BIBL. 7 REF.Conference Paper

ON ALGORITHMS FOR ENUMERATING ALL CIRCUITS OF A GRAPH.PRABHAKER MATETI; NARSINGH DEO.1976; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1976; VOL. 5; NO 1; PP. 90-99; BIBL. 1 P. 1/2Article

ON THE NUMBER OF HAMILTONIAN CIRCUITS IN THE N-CUBE.DIXON E; GOODMAN S.1975; PROC. AMER. MATH. SOC.; U.S.A.; DA. 1975; VOL. 50; NO 193; PP. 500-504; BIBL. 6 REF.Article

SUBGRAPHS AS CIRCUITS AND BASES OF MATROIDS.SIMOES PEREIRA JMS.1975; DISCRETE MATH.; NETHERL.; DA. 1975; VOL. 12; NO 1; PP. 79-88; BIBL. 6 REF.Article

THE EULER CIRCUIT THEOREM FOR BINARY MATROIDS.WILDE PJ.1975; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1975; VOL. 18; NO 3; PP. 260-264; BIBL. 5 REF.Article

HAMILTONIAN CIRCUITS IN SIMPLE 3-POLYTOPES WITH UP TO 26 VERTICES.BARNETTE D; WEGNER G.1974; ISRAEL J. MATH.; ISRAEL; DA. 1974; VOL. 19; NO 3; PP. 212-216; BIBL. 7 REF.Article

A CHARACTERIZATION OF HAMILTONIAN GRAPHS.ZAMFIRESCU T.1974; ATTI ACCAD. SCI. IST. BOLOGNA, SCI. FIS., R.C.; ITAL.; DA. 1974; VOL. 1; NO 2; PP. 39-40Article

ON THE NUMBER OF CERTAIN HAMILTON CIRCUITS OF A COMPLETE GRAPHBAROTI G.1973; PERIOD. MATH. HUNGAR.; HONGR.; DA. 1973; VOL. 3; NO 1-2; PP. 135-139; BIBL. 9 REF.Serial Issue

ON K-PATH HAMILTONIAN GRAPHSZAMFIRESCU T.1972; BOLL. UN. MAT. ITAL.; ITAL.; DA. 1972; VOL. 6; NO 1; PP. 61-66; ABS. FR.; BIBL. 10 REF.Serial Issue

UNA DECOMPOSIZIONE IN GRAFI PARZIALI DELL' 1-GRAFO ORIENTATO, COMPLETO, SIMMETRICO DI ORDINE N = UNE DECOMPOSITION EN GRAPHES PARTIELS D'UN 1-GRAPHE ORIENTE, COMPLET, SYMETRIQUE D'ORDRE NFADINI A.1972; RIC., MAT. PURE APPL.; ITAL.; DA. 1972; VOL. 23; PP. 11-14; ABS. ANGLSerial Issue

A NOTE ON THE NUMBER OF 4-CIRCUITS IN A TOURNAMENTALSPACH B; TABIB C.1982; NORTH-HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1982; VOL. 60; PP. 13-19; BIBL. 10 REF.Article

HOMOPOLAR CIRCUITS IN POLAR GRAPHSANDERSEN LD; GRANT DD.1981; CZECH. MATH. J.; ISSN 0011-4642; CSK; DA. 1981; VOL. 31; NO 2; PP. 218-228; BIBL. 9 REF.Article

SOME CHARACTERIZATION THEOREMS FOR CIRCUIT SPACES ASSOCIATED WITH GRAPHS.BRYANT V; PERFECT H.1977; DISCRETE MATH.; NETHERL.; DA. 1977; VOL. 18; NO 2; PP. 109-124; BIBL. 5 REF.Article

HAMILTONIAN CIRCUITS ON THE N-CUBE.SMITH DH.1975; BULL. CANAD. MATH.; CANADA; DA. 1975; VOL. 17; NO 5; PP. 759-761; BIBL. 5 REF.Article

ON MATROIDS ON EDGE SETS OF GRAPHS WITH CONNECTED SUBGRAPHS AS CIRCUITS II.SIMOES PEREIRA JMS.1975; DISCRETE MATH.; NETHERL.; DA. 1975; VOL. 12; NO 1; PP. 55-78; BIBL. 7 REF.Article

VERTICES MISSED BY LONGEST PATHS OR CIRCUITS.GRUENBAUM B.1974; J. COMBINATOR. THEORY, A; U.S.A.; DA. 1974; VOL. 17; NO 1; PP. 31-38; BIBL. 25 REF.Article

FINITE TOPOLOGIES AND HAMILTONIAN PATHSANDERSON BA.1973; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1973; VOL. 14; NO 1; PP. 87-93; BIBL. 4 REF.Serial Issue

ON SPANNING AND DOMINATING CIRCUITS IN GRAPHS.LESNIAK FOSTER L; WILLIAMSON JE.1977; BULL. CANAD. MATH.; CANADA; DA. 1977; VOL. 20; NO 2; PP. 215-220; BIBL. 4 REF.Article

SNAKES IN POWERS OF COMPLETE GRAPHS.ABBOTT HL; DIERKER PF.1977; S.I.A.M. J. APPL. MATH.; U.S.A.; DA. 1977; VOL. 32; NO 2; PP. 347-355; BIBL. 4 REF.Article

DECOMPOSITION OF KN INTO CIRCUITS OF ODD LENGTH.SOTTEAU D.1976; DISCRETE MATH.; NETHERL.; DA. 1976; VOL. 15; NO 2; PP. 185-191; BIBL. 13 REF.Article

MAXIMAL CIRCUITS OF GRAPHS. I.WOODALL DR.1976; ACTA MATH. ACAD. SCI. HUNGR.; HONGR.; DA. 1976; VOL. 28; NO 1-2; PP. 77-80; BIBL. 5 REF.Article

ON LONGEST PATHS AND CIRCUITS IN GRAPHS.ZAMFIRESCU T.1976; MATH. SCAND.; DANEM.; DA. 1976; VOL. 32; NO 8; PP. 211-239; BIBL. 19 REF.Article

ENUMERATING UNLABELLED HAMILTONIAN CIRCUITS.SINGMASTER D.1975; SER. INTERNATION. ANAL. NUMER.; SUISSE; DA. 1975; VOL. 29; PP. 117-130; ABS. RES. ALLEM.; BIBL. 1 P. 1/2; (NUMER. METHOD. GRAPHENTHEOR. KOMB. PROBL. VORTRAGSAUSZ. TAG. NUMER. METHOD. GRAPHENTHEOR. KOMB, OBERWOLFACH, SCHWARZWALD; 1974)Conference Paper

DEFINITION ET STRUCTURE DES ECOULEMENTS DANS LES GRAPHES SANS CIRCUIT.REYNAUD F.1974; C.R. ACAD. SCI., A; FR.; DA. 1974; VOL. 279; NO 9; PP. 313-316; BIBL. 3 REF.Article

  • Page / 8