REALIZING THE DISTANCE MATRIX OF A GRAPH.NIEMINEN J.1976; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1976; VOL. 12; NO 1-2; PP. 29-31; ABS. ALLEM. RUSSE; BIBL. 2 REF.Article

THE SQUARE OF A BLOCK IS STRONGLY PATH CONNECTED.FAUDREE RJ; SCHELP RH.1976; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1976; VOL. 20; NO 1; PP. 47-61; BIBL. 7 REF.Article

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 CONNECTED GRAPHS.FAUDREE RJ; SCHELP RH.1974; ACTA MATH. ACAD. SCI. HUNGAR.; HONGR.; DA. 1974; VOL. 25; NO 3-4; PP. 313-319; BIBL. 3 REF.Article

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

A SHORTEST PATH ALGORITHM FOR EDGE-SPARSE GRAPHS.WAGNER RA.1976; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1976; VOL. 23; NO 1; PP. 50-57; BIBL. 9 REF.Article

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

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