Long alternating paths in bicolored point setsKYNCL, Jan; PACH, Janos; TOTH, Géza et al.Discrete mathematics. 2008, Vol 308, Num 19, pp 4315-4321, issn 0012-365X, 7 p.Conference Paper

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

Some degree bounds for the circumference of graphsVUMAR, E; JUNG, H. A.Discrete mathematics. 2005, Vol 299, Num 1-3, pp 311-334, issn 0012-365X, 24 p.Article

Locating-dominating codes in pathsEXOO, Geoffrey; JUNNILA, Ville; LAIHONEN, Tero et al.Discrete mathematics. 2011, Vol 311, Num 17, pp 1863-1873, issn 0012-365X, 11 p.Article

Path bundles on n-cubesELDER, Matthew.Discrete mathematics. 2008, Vol 308, Num 16, pp 3479-3490, issn 0012-365X, 12 p.Article

The *-closure for graphs and claw-free graphsCADA, Roman.Discrete mathematics. 2008, Vol 308, Num 23, pp 5585-5596, issn 0012-365X, 12 p.Article

Computing shortest paths with uncertaintyFEDER, Tomas; MOTWANI, Rajeev; O'CALLAGHAN, Liadan et al.Journal of algorithms (Print). 2007, Vol 62, Num 1, pp 1-18, issn 0196-6774, 18 p.Article

Minimal path length of trees with known fringeDE PRISCO, R; PARLATI, G; PERSIANO, G et al.Theoretical computer science. 1995, Vol 143, Num 1, pp 175-188, issn 0304-3975Article

Bandwidth of theta graphs with short pathsPECK, G. W; SHASTRI, A.Discrete mathematics. 1992, Vol 103, Num 2, pp 177-187, issn 0012-365XArticle

Clumps, minimal asymmetric graphs, and involutionsSABIDUSSI, G.Journal of combinatorial theory. Series B. 1991, Vol 53, Num 1, pp 40-79, issn 0095-8956Article

On the maximum length of Huffman codesBURO, M.Information processing letters. 1993, Vol 45, Num 5, pp 219-223, issn 0020-0190Article

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

Rainbow pathsDELLAMONICA, Domingos; MAGNANT, Colton; MARTIN, Daniel M et al.Discrete mathematics. 2010, Vol 310, Num 4, pp 774-781, issn 0012-365X, 8 p.Article

Limits of areas under lattice pathsDRAKE, Brian.Discrete mathematics. 2009, Vol 309, Num 12, pp 3934-3951, issn 0012-365X, 18 p.Article

Radius and subpancyclicity in line graphsLIMING XIONG; QIUXIN WU; MINGCHU LI et al.Discrete mathematics. 2008, Vol 308, Num 23, pp 5325-5333, issn 0012-365X, 9 p.Article

Approximations for minimum and min-max vehicle routing problemsARKIN, Esther M; HASSIN, Refael; LEVIN, Asaf et al.Journal of algorithms (Print). 2006, Vol 59, Num 1, pp 1-18, issn 0196-6774, 18 p.Article

Connections between Wiener index and matchingsWEIGEN YAN; YEH, Yeong-Nan.Journal of mathematical chemistry. 2006, Vol 39, Num 2, pp 389-399, issn 0259-9791, 11 p.Article

Non uniform random generation of generalized Motzkin pathsBRLEK, Srecko; PERGOLA, Elisa; ROQUES, Olivier et al.Acta informatica. 2006, Vol 42, Num 8-9, pp 603-616, issn 0001-5903, 14 p.Article

Odd-K₄'s in stability critical graphsZHIBIN CHEN; WENAN ZANG.Discrete mathematics. 2009, Vol 309, Num 20, pp 5982-5985, issn 0012-365X, 4 p.Article

Minimum embedding of a P₄-design into a balanced incomplete block design of index λDANZIGER, Peter; MILICI, Salvatore; QUATTROCCHI, Gaetano et al.Discrete mathematics. 2009, Vol 309, Num 14, pp 4861-4870, issn 0012-365X, 10 p.Article

FINDING PATHS AND CYCLES OF SUPERPOLYLOGARITHMIC LENGTHGABOW, Harold N.SIAM journal on computing (Print). 2007, Vol 36, Num 6, pp 1648-1671, issn 0097-5397, 24 p.Article

An improved implementation of conditional Monte Carlo estimation of path lengths in stochastic networksKULKARNI, V. G; PROVAN, J. S.Operations research. 1985, Vol 33, Num 6, pp 1389-1393, issn 0030-364XArticle

Pairs of noncrossing free Dyck paths and noncrossing partitionsCHEN, William Y. C; PANG, Sabrina X. M; QU, Ellen X. Y et al.Discrete mathematics. 2009, Vol 309, Num 9, pp 2834-2838, issn 0012-365X, 5 p.Article

A bypassing path based routing algorithm for the pyramid structuresZHIZHANG SHEN.Applied mathematics and computation. 2006, Vol 181, Num 2, pp 1523-1543, issn 0096-3003, 21 p.Article

Distances in random plane-oriented recursive treesMAHMOUD, H. M.Journal of computational and applied mathematics. 1992, Vol 41, Num 1-2, pp 237-245, issn 0377-0427Article