289 | -- | 296 | Peter Adams, Darryn E. Bryant, Saad El-Zanati, Heather Gavlas. Factorizations of the Complete Graph into ::::C:::: ::5::-Factors and 1-Factors |
297 | -- | 307 | Ahmed Ainouche, Ingo Schiermeyer. 0-Dual Closures for Several Classes of Graphs |
309 | -- | 322 | Irène Charon, Olivier Hudry. Links between the Slater Index and the Ryser Index of Tournaments |
323 | -- | 334 | Guantao Chen, Frank J. Hall, Zhongshan Li, Bing Wei. On Ranks of Matrices Associated with Trees |
335 | -- | 345 | Charles J. Colbourn, Alexander Rosa. Specialized Block-Colourings of Steiner Triple Systems and the Upper Chromatic Index |
347 | -- | 356 | Michael U. Gerber, Vadim V. Lozin. Robust Algorithms for the Stable Set Problem |
357 | -- | 361 | John Gimbel. Some Remarks on the Convexity Number of a Graph |
363 | -- | 369 | Akihide Hanaki. Characters of Association Schemes and Normal Closed Subsets |
371 | -- | 387 | Akira Hiraki. The Number of Columns (1, k-2, 1) in the Intersection Array of a Distance-Regular Graph |
389 | -- | 392 | Martin Kochol. A Theorem About Elementary Cuts and Flow Polynomials |
393 | -- | 401 | Xuechao Li, Rong Luo. Edge Coloring of Embedded Graphs with Large Girth |
403 | -- | 411 | T. S. Michael, William N. Traves. Independence Sequences of Well-Covered Graphs: Non-Unimodality and the Roller-Coaster Conjecture |
413 | -- | 418 | Ryuichi Mori, Atsuhiro Nakamoto, Katsuhiro Ota. Diagonal Flips in Hamiltonian Triangulations on the Sphere |
419 | -- | 432 | Xuding Zhu. An Analogue of Hajós Theorem for the Circular Chromatic Number (II) |