Drawing Pfaffian Graphs. - Serguei Norine (GD, 2004)

A new proof of a characterisation of Pfaffian bipartite graphs. - Serguei Norine; Charles H. C. Little; Kee L. Teo (J. Comb. Theory B, 2004)

Unions of perfect matchings in cubic graphs. - Tomás Kaiser; Daniel Král; Serguei Norine (Electron. Notes Discret. Math., 2005)

Matching structure and Pfaffian orientations of graphs. - Serguei Norine (2005)

The Circular Chromatic Index of Flower Snarks. - Mohammad Ghebleh; Daniel Král; Serguei Norine; Robin Thomas 001 (Electron. J. Comb., 2006)

Proper minor-closed families are small. - Serguei Norine; Paul D. Seymour; Robin Thomas 001; Paul Wollan (J. Comb. Theory B, 2006)

Minimal bricks. - Serguei Norine; Robin Thomas 001 (J. Comb. Theory B, 2006)

Generating bricks. - Serguei Norine; Robin Thomas 001 (J. Comb. Theory B, 2007)

Pfaffian graphs, T -joins and crossing numbers. - Serguei Norine (Comb., 2008)

Pfaffian labelings and signs of edge colorings. - Serguei Norine; Robin Thomas 001 (Comb., 2008)

Circular Degree Choosability. - Serguei Norine; Xuding Zhu (Electron. J. Comb., 2008)

Graphs with full rank 3-color matrix and few 3-colorings. - Serguei Norine; Jean-Sébastien Sereni (J. Comb. Theory B, 2008)

Minimally non-Pfaffian graphs. - Serguei Norine; Robin Thomas 001 (J. Comb. Theory B, 2008)

On two questions about circular choosability. - Serguei Norine (J. Graph Theory, 2008)

Circular choosability via combinatorial Nullstellensatz. - Serguei Norine; Tsai-Lien Wong; Xuding Zhu (J. Graph Theory, 2008)

Drawing 4-Pfaffian graphs on the torus. - Serguei Norine (Comb., 2009)

Holographic algorithms without matchgates - J. M. Landsberg; Jason Morton; Serguei Norine (CoRR, 2009)

Small graph classes and bounded expansion. - Zdenek Dvorák 001; Serguei Norine (J. Comb. Theory B, 2010)

Markov bases of binary graph models of K4-minor free graphs. - Daniel Král'; Serguei Norine; Ondrej Pangrác (J. Comb. Theory A, 2010)

Voting in Agreeable Societies. - Deborah E. Berg; Serguei Norine; Francis Edward Su; Robin Thomas 001; Paul Wollan (Am. Math. Mon., 2010)

Jacobians of nearly complete and threshold graphs. - Serguei Norine; Peter Whalen (Eur. J. Comb., 2011)

Circular consecutive choosability of k-choosable graphs. - Daphne Der-Fen Liu; Serguei Norine; Zhishi Pan; Xuding Zhu (J. Graph Theory, 2011)

Turán Graphs and the Number of Colorings. - Serguei Norine (SIAM J. Discret. Math., 2011)

K_6 minors in 6-connected graphs of bounded tree-width - Ken-ichi Kawarabayashi; Serguei Norine; Robin Thomas 001; Paul Wollan (CoRR, 2012)

K_6 minors in large 6-connected graphs - Ken-ichi Kawarabayashi; Serguei Norine; Robin Thomas 001; Paul Wollan (CoRR, 2012)

Non-Three-Colourable Common Graphs Exist. - Hamed Hatami; Jan Hladký; Daniel Král'; Serguei Norine; Alexander A. Razborov (Comb. Probab. Comput., 2012)

The Entropy of Random-Free Graphons and Properties. - Hamed Hatami; Serguei Norine (Comb. Probab. Comput., 2013)

On the number of pentagons in triangle-free graphs. - Hamed Hatami; Jan Hladký; Daniel Král'; Serguei Norine; Alexander A. Razborov (J. Comb. Theory A, 2013)

Rank of divisors on tropical curves. - Jan Hladký; Daniel Král'; Serguei Norine (J. Comb. Theory A, 2013)

The inducibility of blow-up graphs. - Hamed Hatami; James Hirst; Serguei Norine (J. Comb. Theory B, 2014)

K6 minors in large 6-connected graphs. - Ken-ichi Kawarabayashi; Serguei Norine; Robin Thomas 001; Paul Wollan (J. Comb. Theory B, 2018)

K6 minors in 6-connected graphs of bounded tree-width. - Ken-ichi Kawarabayashi; Serguei Norine; Robin Thomas 001; Paul Wollan (J. Comb. Theory B, 2019)