The patch-partition problem in block graphsJING-HO YAN; CHANG, G. J.Information processing letters. 1994, Vol 52, Num 6, pp 317-322, issn 0020-0190Article

The all-to-all alternative route problemBOFFEY, B.RAIRO. Recherche opérationnelle. 1993, Vol 27, Num 4, pp 375-387, issn 0399-0559Article

Matrices with elements from a division ringNAMBIAR, K. K.Mathematical and computer modelling. 1996, Vol 24, Num 1, pp 1-3, issn 0895-7177Article

Binary trees, fringe thickness and minimum path lengthCAMERON, H; WOOD, D.Informatique théorique et applications (Imprimé). 1995, Vol 29, Num 3, pp 171-191, issn 0988-3754Article

Determination of the most reliable path of a planar flow networkDONG WHA LEE; BONG JIN YUM.Reliability engineering & systems safety. 1994, Vol 46, Num 3, pp 231-236, issn 0951-8320Article

Disturbance rejection for structured systemsCOMMAULT, C; DION, J.-M; PEREZ, A et al.IEEE transactions on automatic control. 1991, Vol 36, Num 7, pp 884-887, issn 0018-9286Article

The spectral moments of trees with given maximum degreePAN, Xiang-Feng; XIAOLAN HU; XIUGUO LIU et al.Applied mathematics letters. 2011, Vol 24, Num 7, pp 1265-1268, issn 0893-9659, 4 p.Article

Two Spanning Disjoint Paths with Required Length in Arrangement GraphsTENG, Yuan-Hsiang; SHIH, Yuan-Kang; TAN, Jimmy J. M et al.Parallel and distributed processing techniques and applications. International conferenceWorldComp'2010. 2010, pp 527-531, isbn 1-60132-156-2 1-60132-157-0 1-60132-158-9, 5 p.Conference Paper

Path transferability of graphsTORII, Ryuzo.Discrete mathematics. 2008, Vol 308, Num 17, pp 3782-3804, issn 0012-365X, 23 p.Article

The k-ball l-path branch weight centroidREID, K. B.Discrete applied mathematics. 1997, Vol 80, Num 2-3, pp 239-246, issn 0166-218XArticle

A note on packing paths in planar graphsFRANK, A; SZIGETI, Z.Mathematical programming. 1995, Vol 70, Num 2, pp 201-209, issn 0025-5610Article

An approximation algorithm for clustering graphs with dominating diametral pathDEOGUN, J. S; KRATSCH, D; STEINER, G et al.Information processing letters. 1997, Vol 61, Num 3, pp 121-127, issn 0020-0190Article

Efficient algorithms for finding a core of a three with a specified lengthPENG, S; LO, W.-T.Journal of algorithms (Print). 1996, Vol 20, Num 3, pp 445-458, issn 0196-6774Article

ISOMORPHISM AND MORITA EQUIVALENCE OF GRAPH ALGEBRASABRAMS, Gene; TOMFORDE, Mark.Transactions of the American Mathematical Society. 2011, Vol 363, Num 7, pp 3733-3767, issn 0002-9947, 35 p.Article

Paths with two blocks in k-chromatic digraphsEL SAHILI, Amine.Discrete mathematics. 2004, Vol 287, Num 1-3, pp 151-153, issn 0012-365X, 3 p.Article

Monochromatic paths and triangulated graphsEVEN, S; LITMAN, A; ROSENBERG, A. L et al.SIAM journal on discrete mathematics (Print). 1998, Vol 11, Num 4, pp 546-556, issn 0895-4801Article

Paths with minimum range and ratio of arc lengthsHANSEN, P; STORCHI, G; VOVOR, T et al.Discrete applied mathematics. 1997, Vol 78, Num 1-3, pp 89-102, issn 0166-218XArticle

Generation of vertex and edge cutsetsPRASAD, V. C; SANKAR, V; PRAKASA RAO, K. S et al.Microelectronics and reliability. 1992, Vol 32, Num 9, pp 1291-1310, issn 0026-2714Article

An algorithm to find all paths between two nodes in a graphMIGLIORE, M; MARTORANA, V; SCIORTINO, F et al.Journal of computational physics (Print). 1990, Vol 87, Num 1, pp 231-236, issn 0021-9991Article

Hamilton-decomposable graphs and digraphs of infinite valenceWITTE, D.Discrete mathematics. 1990, Vol 84, Num 1, pp 87-100, issn 0012-365XArticle

Simple alternating path problemAKIYAMA, J; URRUTIA, J.Discrete mathematics. 1990, Vol 84, Num 1, pp 101-103, issn 0012-365XArticle

Algorithms for long paths in graphsZHAO ZHANG; HAO LI.Theoretical computer science. 2007, Vol 377, Num 1-3, pp 25-34, issn 0304-3975, 10 p.Article

The complement of the path is determined by its spectrumDOOB, Michael; HAEMERS, Willem H.Linear algebra and its applications. 2002, Vol 356, pp 57-65, issn 0024-3795Article

Page / 36