| 373 | -- | 380 | Eric Babson, Julian West. The Permutations 123 ::::p:::: ::4::... ::::p:::: :: ::::m:::: :: and 321 ::::p:::: ::4::... ::::p:::: :: ::::m:::: :: are Wilf-Equivalent |
| 381 | -- | 387 | Andreas Brandstädt, Van Bang Le, Stephan Olariu. Efficiently Recognizing the ::::P:::: ::4::-Structure of Trees and of Bipartite Graphs Without Short Cycles |
| 389 | -- | 398 | Emanuela Fachini, János Körner. Colour Number, Capacity, and Perfectness of Directed Graphs |
| 399 | -- | 410 | Ralph J. Faudree, Evelyne Flandrin, Michael S. Jacobson, Jeno Lehel, Richard H. Schelp. Even Cycles in Graphs with Many Odd Cycles |
| 411 | -- | 427 | Xiaoyun Lu, Da-Wei Wang, Jiaofeng Pan, C. K. Wong. Rooted Spanning Trees in Tournaments |
| 429 | -- | 439 | Sean McGuinness. Colouring Arcwise Connected Sets in the Plane I |
| 441 | -- | 452 | Dhruv Mubayi, Douglas B. West. On the Number of Vertices with Specified Eccentricity |
| 453 | -- | 462 | Hong Wang. Independent Directed Triangles in a Directed Graph |
| 463 | -- | 465 | Boris Zgrablic. A Note on Adjacency-Transitivity of a Graph and Its Complement |
| 467 | -- | 495 | Limin Zhang. Every Planar Graph with Maximum Degree 7 Is of Class 1 |