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

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 λK_v 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 2^m 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

Generalized local colorings of graphsTRUSZCZYNSKI, M.Journal of combinatorial theory. Series B. 1992, Vol 54, Num 2, pp 178-188, issn 0095-8956Article

CONSTRUCTING CONVEX PLANES IN THE PANTS COMPLEXARAMAYONA, Javier; PARLIER, Hugo; SHACKLETON, Kenneth J et al.Proceedings of the American Mathematical Society. 2009, Vol 137, Num 10, pp 3523-3531, issn 0002-9939, 9 p.Article

Tree-width of graphs without a 3 x 3 grid minorBIRMELE, E; BONDY, J. A; REED, B. A et al.Discrete applied mathematics. 2009, Vol 157, Num 12, pp 2577-2596, issn 0166-218X, 20 p.Conference Paper

A characterization of the split cayley generalized hexagon H(q) using one subhexagon of order (1, q)DE KAEY, Joris; VAN MALDEGHEM, Hendrik.Discrete mathematics. 2005, Vol 294, Num 1-2, pp 109-118, issn 0012-365X, 10 p.Conference Paper

Isomorphic subgraphsBACHL, S.Lecture notes in computer science. 1999, pp 286-296, issn 0302-9743, isbn 3-540-66904-3Conference Paper

Center, median, and centroid subgraphsSMART, C; SLATER, P. J.Networks (New York, NY). 1999, Vol 34, Num 4, pp 303-311, issn 0028-3045Article

Identification of β-sheet motifs, of ψ-loops, and of patterns of amino acid residues in three-dimensional protein structures using a subgraph-isomorphism algorithmARTYMIUK, P. J; GRINDLEY, H. M; POIRRETTE, A. R et al.Journal of chemical information and computer sciences. 1994, Vol 34, Num 1, pp 54-62, issn 0095-2338Conference Paper

Directed distance in digraphs: centers and mediansCHARTRAND, G; JOHNS, G. L; SONGLIN TIAN et al.Journal of graph theory. 1993, Vol 17, Num 4, pp 509-521, issn 0364-9024Article

Geometric characterization of graphs from the Suzuki chainPASECHNIK, D. V.European journal of combinatorics. 1993, Vol 14, Num 5, pp 491-499, issn 0195-6698Article

Long cycles and the codiameter of a graph. IFAN, G.Journal of combinatorial theory. Series B. 1990, Vol 49, Num 2, pp 151-180, issn 0095-8956Article

On an improved approach for nonlinear system identification using neural networksHANNA, Andrew I; MANDIC, Danilo P.Journal of the Franklin Institute. 2003, Vol 340, Num 5, pp 363-370, issn 0016-0032, 8 p.Article