Monotone paths in edge-ordered sparse graphs

Discrete Mathematics

Volumn 226, Issue 1-3, 2001, Pages 411-417

  Roditty, Yehuda ^a,b   Shoham, Barack ^a   Yuster, Raphael ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b ACADEMIC COLLEGE OF TEL AVIV YAFFO   (Israel)

^c UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 16344385815     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00174-6     Document Type: Article

References (9)

1. I. Algor, N. Mon, The star arboricity of graphs, Discrete Math. 75 (1989) 11-22.
2. N. Alon, C. McDiarmid, B. Reed, Star arboricity, Combinatorica 12 (1992) 375-380.
3. A. Bialostocki, Y. Roditty, Monotone paths in an edge-ordered graphs, Int. J. Math. Math. Sci. 10 (1987) 315-320.
4. B. Bollobás, Extremal Graph Theory, Academic Press, New York, 1978.
5. A.R. Calderbank, F.R.K. Chung, D.G. Sturtevant, Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs, Discrete Math. 50 (1984) 15-28.
6. V. Chvátal, J. Komlós, Some combinatorial theorems on monotonicity, Canad. Math. Bull. 14 (1971) 151-157.
7. R.L. Graham, D.J. Kleitman, Increasing paths in edge-ordered graphs, Per. Math. Hungar. 3 (1973) 141-148.
8. S.L. Hakimi, J. Mitchem, E. Schmeichel, Star arboricity of graphs, Discrete Math. 149 (1996) 93-98.
9. C.St.J.A. Nash-Williams, Decomposition of finite graphs into forests, J. London Math. Soc. 39 (1964) 12.