default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSerguei Norine
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2005
[b1]Serguei Norine:
Matching structure and Pfaffian orientations of graphs. Georgia Institute of Technology, Atlanta, GA, USA, 2005
Journal Articles
- 2019
- [j27]Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan:
K6 minors in 6-connected graphs of bounded tree-width. J. Comb. Theory B 136: 1-32 (2019) - 2018
- [j26]Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan:
K6 minors in large 6-connected graphs. J. Comb. Theory B 129: 158-203 (2018) - 2014
- [j25]Hamed Hatami, James Hirst, Serguei Norine:
The inducibility of blow-up graphs. J. Comb. Theory B 109: 196-212 (2014) - 2013
- [j24]Hamed Hatami, Serguei Norine:
The Entropy of Random-Free Graphons and Properties. Comb. Probab. Comput. 22(4): 517-526 (2013) - [j23]Hamed Hatami, Jan Hladký
, Daniel Král', Serguei Norine, Alexander A. Razborov:
On the number of pentagons in triangle-free graphs. J. Comb. Theory A 120(3): 722-732 (2013) - [j22]Jan Hladký, Daniel Král', Serguei Norine:
Rank of divisors on tropical curves. J. Comb. Theory A 120(7): 1521-1538 (2013) - 2012
- [j21]Hamed Hatami, Jan Hladký, Daniel Král', Serguei Norine, Alexander A. Razborov:
Non-Three-Colourable Common Graphs Exist. Comb. Probab. Comput. 21(5): 734-742 (2012) - 2011
- [j20]Serguei Norine, Peter Whalen:
Jacobians of nearly complete and threshold graphs. Eur. J. Comb. 32(8): 1368-1376 (2011) - [j19]Daphne Der-Fen Liu, Serguei Norine, Zhishi Pan, Xuding Zhu:
Circular consecutive choosability of k-choosable graphs. J. Graph Theory 67(3): 178-197 (2011) - [j18]Serguei Norine:
Turán Graphs and the Number of Colorings. SIAM J. Discret. Math. 25(1): 260-266 (2011) - 2010
- [j17]Zdenek Dvorák, Serguei Norine:
Small graph classes and bounded expansion. J. Comb. Theory B 100(2): 171-175 (2010) - [j16]Daniel Král', Serguei Norine, Ondrej Pangrác:
Markov bases of binary graph models of K4-minor free graphs. J. Comb. Theory A 117(6): 759-765 (2010) - [j15]Deborah E. Berg, Serguei Norine, Francis Edward Su, Robin Thomas, Paul Wollan:
Voting in Agreeable Societies. Am. Math. Mon. 117(1): 27-39 (2010) - 2009
- [j14]Serguei Norine:
Drawing 4-Pfaffian graphs on the torus. Comb. 29(1): 109-119 (2009) - 2008
- [j13]Serguei Norine:
Pfaffian graphs, T -joins and crossing numbers. Comb. 28(1): 89-98 (2008) - [j12]Serguei Norine, Robin Thomas:
Pfaffian labelings and signs of edge colorings. Comb. 28(1): 99-111 (2008) - [j11]Serguei Norine, Xuding Zhu:
Circular Degree Choosability. Electron. J. Comb. 15(1) (2008) - [j10]Serguei Norine, Robin Thomas:
Minimally non-Pfaffian graphs. J. Comb. Theory B 98(5): 1038-1055 (2008) - [j9]Serguei Norine, Jean-Sébastien Sereni:
Graphs with full rank 3-color matrix and few 3-colorings. J. Comb. Theory B 98(5): 1115-1116 (2008) - [j8]Serguei Norine:
On two questions about circular choosability. J. Graph Theory 58(3): 261-269 (2008) - [j7]Serguei Norine, Tsai-Lien Wong, Xuding Zhu:
Circular choosability via combinatorial Nullstellensatz. J. Graph Theory 59(3): 190-204 (2008) - 2007
- [j6]Serguei Norine, Robin Thomas:
Generating bricks. J. Comb. Theory B 97(5): 769-817 (2007) - 2006
- [j5]Mohammad Ghebleh, Daniel Král, Serguei Norine, Robin Thomas:
The Circular Chromatic Index of Flower Snarks. Electron. J. Comb. 13(1) (2006) - [j4]Serguei Norine, Robin Thomas:
Minimal bricks. J. Comb. Theory B 96(4): 505-513 (2006) - [j3]Serguei Norine, Paul D. Seymour, Robin Thomas, Paul Wollan:
Proper minor-closed families are small. J. Comb. Theory B 96(5): 754-757 (2006) - 2005
- [j2]Tomás Kaiser, Daniel Král, Serguei Norine:
Unions of perfect matchings in cubic graphs. Electron. Notes Discret. Math. 22: 341-345 (2005) - 2004
- [j1]Serguei Norine, Charles H. C. Little, Kee L. Teo:
A new proof of a characterisation of Pfaffian bipartite graphs. J. Comb. Theory B 91(1): 123-126 (2004)
Conference and Workshop Papers
- 2004
- [c1]Serguei Norine:
Drawing Pfaffian Graphs. GD 2004: 371-376
Informal and Other Publications
- 2019
- [i4]Serguei Norine, Robin Thomas:
Minimal bricks. CoRR abs/1907.00305 (2019) - 2012
- [i3]Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan:
K_6 minors in 6-connected graphs of bounded tree-width. CoRR abs/1203.2171 (2012) - [i2]Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan:
K_6 minors in large 6-connected graphs. CoRR abs/1203.2192 (2012) - 2009
- [i1]J. M. Landsberg, Jason Morton, Serguei Norine:
Holographic algorithms without matchgates. CoRR abs/0904.0471 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-15 19:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
