1. The Permutations 123p ₄…p _m and 321p ₄…p _m are Wilf-Equivalent

   • Eric Babson
   • Julian West

   Pages: 373 - 380

2. Efficiently Recognizing the P ₄-Structure of Trees and of Bipartite Graphs Without Short Cycles

   • Andreas Brandstädt
   • Van Bang Le
   • Stephan Olariu

   Pages: 381 - 387

3. Colour Number, Capacity, and Perfectness of Directed Graphs

   • Emanuela Fachini
   • János Körner

   Pages: 389 - 398

4. Even Cycles in Graphs with Many Odd Cycles

   • Ralph J. Faudree
   • Evelyne Flandrin
   • Richard H. Schelp

   Pages: 399 - 410

5. Rooted Spanning Trees in Tournaments

   • Xiaoyun Lu
   • Da-Wei Wang
   • C. K. Wong

   Pages: 411 - 427

6. Colouring Arcwise Connected Sets in the Plane I

   • Sean McGuinness

   Pages: 429 - 439

7. On the Number of Vertices with Specified Eccentricity

   • Dhruv Mubayi
   • Douglas B. West

   Pages: 441 - 452

8. Independent Directed Triangles in a Directed Graph

   • Hong WangRID="*"ID="*" This research was supported by UIRC SEED GRANTS–KDY932

   Pages: 453 - 462

9. A Note on Adjacency-Transitivity of a Graph and Its Complement

   • Boris Zgrablić

   Pages: 463 - 465

10. Every Planar Graph with Maximum Degree 7 Is of Class 1

    • Limin Zhang

    Pages: 467 - 495