Journal of Combinatorics

Volume 8 (2017)

Number 1

Contents

Moments of matching statistics

Niraj Khare, Rudolph Lorentz, and Catherine H. Yan

pp. 1-27

A generalization of the $r$-Whitney numbers of the second kind

Toufik Mansour, José L. Ramírez, and Mark Shattuck

pp. 29-55

Random subgraphs make identification affordable

Florent Foucaud, Guillem Perarnau, and Oriol Serra

pp. 57-77

Adversarial resilience of matchings in bipartite random graphs

Paul Balister, Stefanie Gerke, and Andrew McDowell

pp. 79-92

Induced forests in bipartite planar graphs

Yan Wang, Qiqin Xie, and Xingxing Yu

pp. 93-166

Incidence coloring of planar graphs without adjacent small cycles

Hervé Hocquard, Samia Kerdjoudj, and André Raspaud

pp. 167-187

Circular chromatic Ramsey number

Kyle F. Jao, Claude Tardif, Douglas B. West, and Xuding Zhu

pp. 189-208

Note on “hook-length” as a graph invariant of trees

Hua Wang

pp. 209-226