NewEvery arXiv paper, its researchers & institutions — mapped.
papers

Publications (3)

math.CO2018

A Pascal-like Bound for the Number of Necklaces with Fixed Density

I. Heckenberger, J. Sawada

cs.DS2007

Deciding k-colourability of $P_5$-free graphs in polynomial time

Chính T. Hoà ng, Marcin Kamiński, Vadim Lozin +2

cs.DM2006

k-Colorability of P5-free graphs

C. T. Hoang, J. Sawada, X. Shu