Journal of Combinatorics

Volume 3 (2012)

Number 2

Contents

Partitioning graphs into paths or cycles of prescribed lengths

Colton Magnant and Kenta Ozeki

pp. 135-161

Limits of interval orders and semiorders

Svante Janson

pp. 163-183

Recurrent rotor-router configurations

Omer Angel and Alexander E. Holroyd

pp. 185-194

Revolutionaries and spies on trees and unicyclic graphs

Daniel W. Cranston, Clifford D. Smyth, and Douglas B. West

pp. 195-205

Trees with the most subtrees: an algorithmic approach

Daniel Gray, Hua Wang, Xiao-Dong Zhang, and Xiu-Mei Zhang

pp. 207-223

Meyniel’s conjecture on the cop number: A survey

William Baird and Anthony Bonato

pp. 225-238