Disjoint paths in graphsSEYMOUR, P. D.Discrete mathematics. 2006, Vol 306, Num 10-11, pp 979-991, issn 0012-365X, 13 p.Article

Path-connectivity in graphsHAGER, M.Discrete mathematics. 1986, Vol 59, Num 1-2, pp 53-59, issn 0012-365XArticle

Disjoint paths. A surveyROBERTSON, N; SEYMOUR, P. D.SIAM journal on algebraic and discrete methods. 1985, Vol 6, Num 2, pp 300-305, issn 0196-5212Article

The 2-linkage problem for acyclic digraphsTHOMASSEN, C.Discrete mathematics. 1985, Vol 55, Num 1, pp 73-87, issn 0012-365XArticle

Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphsCALDERBANK, A. R; CHUNG, F. R. K; STURTEVANT, D. G et al.Discrete mathematics. 1984, Vol 50, Num 1, pp 15-28, issn 0012-365XArticle

Three commodity flows in graphsOKAMURA, H; IYANAGA, S.Proceedings of the Japan Academy. Series A Mathematical sciences. 1983, Vol 59, Num 6, pp 266-269, issn 0386-2194Article

On the characterization of path graphsHUAIEN LI; YIXUN LIN.Journal of graph theory. 1993, Vol 17, Num 4, pp 463-466, issn 0364-9024Article

A new conjecture about minimal imperfect graphsMEYNIEL, H; OLARIU, S.Journal of combinatorial theory. Series B. 1989, Vol 47, Num 2, pp 244-247, issn 0095-8956, 4 p.Article

Digraphs without directed path of length two or threeSOTTEAU, D; WOJDA, A. P.Discrete mathematics. 1986, Vol 58, Num 1, pp 105-108, issn 0012-365XArticle

A generalization of Dirac's theoremLOCKE, S. C.Combinatorica (Print). 1985, Vol 5, Num 2, pp 149-159, issn 0209-9683Article

Edge and vertex intersection of paths in a treeGOLUMBIC, M. C; JAMISON, R. E.Discrete mathematics. 1985, Vol 55, Num 2, pp 151-159, issn 0012-365XArticle

Finding the two-core of a treeBECKER, R. I; PERL, Y.Discrete applied mathematics. 1985, Vol 11, Num 2, pp 103-113, issn 0166-218XArticle

Bounds on path connectivityITAI, A; ZEHAVI, A.Discrete mathematics. 1984, Vol 51, Num 1, pp 25-34, issn 0012-365XArticle

Chemins extrémaux d'un graphe doublement valué = Extremal paths of a weighted both graphCHRETIENNE, P.RAIRO. Recherche opérationnelle. 1984, Vol 18, Num 3, pp 221-245, issn 0399-0559Article

Path partitions and packs of acyclic digraphsAHARONI, R; BEN-ARROYO-HARTMAN, I; HOFFMAN, A. J et al.Pacific journal of mathematics. 1985, Vol 118, Num 2, pp 249-259, issn 0030-8730Article

An extremal problem for paths in bipartite graphsGYARFAS, A; ROUSSEAU, C. C; SCHELP, R. H et al.Journal of graph theory. 1984, Vol 8, Num 1, pp 83-95, issn 0364-9024Article

A simple proof of Mengeŕs theoremMCCUAIG, W.Journal of graph theory. 1984, Vol 8, Num 3, pp 427-429, issn 0364-9024Article

The Johnson graph J(d, r) is unique if (d, r)¬=(2,8)TERWILLIGER, P.Discrete mathematics. 1986, Vol 58, Num 2, pp 175-189, issn 0012-365XArticle

A short proof for the Faudree-Schelp theorem on path-connected graphsCAI XIAO-TAO.Journal of graph theory. 1984, Vol 8, Num 1, pp 109-110, issn 0364-9024Article

A sufficient condition for a graph to be weakly k-linkedHIRATA, T; KUBOTA, K; SAITO, O et al.Journal of combinatorial theory. Series B. 1984, Vol 36, Num 1, pp 85-94, issn 0095-8956Article

Long paths and large cycles in finite graphsENOMOTO, H.Journal of graph theory. 1984, Vol 8, Num 2, pp 287-301, issn 0364-9024Article

On finding the core of a tree with a specified lengthMINIEKA, E; PATEL, N. H.Journal of algorithms (Print). 1983, Vol 4, Num 4, pp 345-352, issn 0196-6774Article

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

Polyèdre des chemins reliant deux sommets d'un grapheSHLYK, V. A.Vesci Akademii navuk BSSR. Seryâ fizika-matematyčnyh navuk. 1986, Num 1, pp 23-28, issn 0002-3574Article