Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Graphe isomorphe")

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 206

  • Page / 9
Export

Selection :

  • and

Application of edge permutation group to structural synthesis of epicyclic gear trainsJAE UK KIM; BYUNG MAN KWAK.Mechanism and machine theory. 1990, Vol 25, Num 5, pp 563-574, issn 0094-114X, 12 p.Article

Testing homotopy equivalence is isomorphism completeZALCSTEIN, Y; FRANKLIN, S. P.Discrete applied mathematics. 1986, Vol 13, Num 1, pp 101-104, issn 0166-218XArticle

Cataloguing the graphs on 10 verticesCAMERON, R. D; COLBOURN, C. J; READ, R. C et al.Journal of graph theory. 1985, Vol 9, Num 4, pp 551-562, issn 0364-9024Article

Randomly decomposable graphsRUIZ, S.Discrete mathematics. 1985, Vol 57, Num 1-2, pp 123-128, issn 0012-365XArticle

Characterization of the cartesian product of complete graphs by convex subgraphsEGAWA, Y.Discrete mathematics. 1986, Vol 58, Num 3, pp 307-309, issn 0012-365XArticle

PROPRIETES DES ESPACES METRIQUES DE CLASSES D'ISOMORPHISME DE GRAPHESKORNIENKO NM.1981; VESCI AKAD. NAVUK BSSR, SER. FIZ.-MAT. NAVUK; ISSN 0002-3574; BYS; DA. 1981; NO 2; PP. 32-36; ABS. ENG; BIBL. 6 REF.Article

Some remarks on universal graphsDIESTEL, R; HALIN, R; VOGLER, W et al.Combinatorica (Print). 1985, Vol 5, Num 4, pp 283-293, issn 0209-9683Article

Planarity testing of graphs on base of a spring modelHOTZ, Günter; LOHSE, Steffen.Lecture notes in computer science. 2002, pp 471-472, issn 0302-9743, isbn 3-540-43309-0Conference Paper

A semi-strong perfect graph theoremREED, B.Journal of combinatorial theory. Series B. 1987, Vol 43, Num 2, pp 223-240, issn 0095-8956Article

Stability, domination and irredundance in a graphFAVARON, O.Journal of graph theory. 1986, Vol 10, Num 4, pp 429-438, issn 0364-9024Article

METRISATION D'UNE CLASSE DE GRAPHESMETEL'SKIJ NN; KORNIENKO NM.1979; DOKL. AKAD. NAUK B.S.S.R.; SUN; DA. 1979; VOL. 23; NO 1; PP. 5-7; ABS. ENG; BIBL. 3 REF.Article

Cayley graphs of finitely generated groupsTHOMAS, Simon.Proceedings of the American Mathematical Society. 2006, Vol 134, Num 1, pp 289-294, issn 0002-9939, 6 p.Article

The ultracenter and central fringe of a graphCHARTRAND, Gary; NOVOTNY, Karen S; WINTERS, Steven J et al.Networks (New York, NY). 2001, Vol 38, Num 1, pp 33-38, issn 0028-3045Article

Florentine rows or left-right shifted permutation matrices with cross-correlation values ≤1TAYLOR, H.Discrete mathematics. 1991, Vol 93, Num 2-3, pp 247-260, issn 0012-365XArticle

Long cycles in subgraphs with prescribed minimum degreeCACCETTA, L; VIJAYAN, K.Discrete mathematics. 1991, Vol 97, Num 1-3, pp 69-81, issn 0012-365XArticle

On nesting of G-decompositions of λKv where G has four nonisolated vertices or lessMILICI, Salvatore; QUATTROCCHI, Gaetano.Discrete mathematics. 2002, Vol 255, Num 1-3, pp 297-315, issn 0012-365XConference Paper

Constructing status injective graphsPACHTER, L.Discrete applied mathematics. 1997, Vol 80, Num 1, pp 107-113, issn 0166-218XArticle

Halving Steiner triple systemsDAS, P. K; ROSA, A.Discrete mathematics. 1992, Vol 109, Num 1-3, pp 59-67, issn 0012-365XArticle

Saturated r-uniform hypergraphsERDÖS, P; FÜREDI, Z; TUZA, Z et al.Discrete mathematics. 1991, Vol 98, Num 2, pp 95-104, issn 0012-365XArticle

Integral circulant graphsSO, Wasin.Discrete mathematics. 2006, Vol 306, Num 1, pp 153-158, issn 0012-365X, 6 p.Article

A series of search designs for 2m factorial designs of resolution V which permit search of one or two unknown extra three-factor interactionsSHIRAKURA, T; TAZAWA, S.Annals of the Institute of Statistical Mathematics. 1992, Vol 44, Num 1, pp 185-196, issn 0020-3157Article

Distinct distance sets in a graphGIBBS, R. A; SLATER, P. J.Discrete mathematics. 1991, Vol 93, Num 2-3, pp 155-165, issn 0012-365XArticle

On the cycle-isomorphism of graphsXINGXING YU.Journal of graph theory. 1991, Vol 15, Num 1, pp 19-27, issn 0364-9024Article

On the number of irregular assignments on a graphEBERT, G; HEMMETER, J; LAZEBNIK, F et al.Discrete mathematics. 1991, Vol 93, Num 2-3, pp 131-142, issn 0012-365XArticle

An application of the linkage characteristic polynomial to the topological synthesis of epicyclic gear trainsLUNG-WEN TSAI.Journal of mechanisms, transmissions, and automation in design. 1987, Vol 109, Num 3, pp 329-336, issn 0738-0666Article

  • Page / 9