Large monotone paths in graphs with bounded degree

Graphs and Combinatorics

Volumn 17, Issue 3, 2001, Pages 579-587

  Yuster, Raphael ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0344957718     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/s003730170031     Document Type: Article

References (8)

1. Alon, N., Spencer, J.H.: The Probabilistic Method. New York: John Wiley and Sons 1991
2. Bialostocki, A., Roditty, Y.: Monotone paths in an edge-ordered graphs. Int. J. Math. Math. Sci. 10, 315-320 (1987)
3. Bollobás, B.: Extremal Graph Theory. Academic Press 1978
4. Calderbank, A.R., Chung, F.R.K., Sturtevant, D.G.: Increasing sequences with non-zero block sums and increasing paths in edge-ordered graphs. Discrete Math. 50, 15-28 (1984)
5. Chvátal, V., Komlós, J.: Some combinatorial theorems on monotonicity. Can. Math. Bull. 14, 151-157 (1971)
6. Graham, R.L., Kleitman, D.J.: Increasing paths in edge-ordered graphs. Period. Math. Hung. 3, 141-148 (1973)
7. Nash-Williams, C.St.J.A.: Decomposition of finite graphs into forests. J. Lond. Math. Soc. 39, 12 (1964)
8. Roditty, Y., Shoham, B., Yuster, R.: Monotone paths in edge-ordered sparse graphs. Discrete Math. 226, 411-417 (2001)