10 citations · 12 across the 2 of their papers we have counts for
2 papers
math.CO2008★ 2 cited
Markov bases of binary graph models of K_4-minor free graphs
Daniel Král', Serguei Norine, Ondrej Pangrác
Markov width of a graph is a graph invariant defined as the maximum degree of a Markov basis element for the corresponding graph model for binary contingency tables. We show that a…
math.CO2007★ 10 cited
Harmonic morphisms and hyperelliptic graphs
Matthew Baker, Serguei Norine
We study harmonic morphisms of graphs as a natural discrete analogue of holomorphic maps between Riemann surfaces. We formulate a graph-theoretic analogue of the classical Riemann-…