Sciweavers

3 search results - page 1 / 1
» A zero-free interval for flow polynomials of cubic graphs
Sort
View
CPC
2007
88views more  CPC 2007»
13 years 5 months ago
Zero-Free Intervals for Flow Polynomials of Near-Cubic Graphs
Let P(G,t) and F(G,t) denote the chromatic and flow polynomials of a graph G. G.D. Birkhoff and D.C. Lewis showed that, if G is a plane near triangulation, then the only zeros of...
Bill Jackson
JCT
2007
94views more  JCT 2007»
13 years 4 months ago
A zero-free interval for flow polynomials of cubic graphs
Let P(G,t) and F(G,t) denote the chromatic and flow polynomials of a graph G. D.R. Woodall has shown that, if G is a plane triangulation, then the only zeros of P(G,t) in (−∞...
Bill Jackson
ICMLA
2009
13 years 2 months ago
Exact Graph Structure Estimation with Degree Priors
We describe a generative model for graph edges under specific degree distributions which admits an exact and efficient inference method for recovering the most likely structure. T...
Bert Huang, Tony Jebara