Bollobás–Riordan polynomial

Known as: Bollobás-Riordan polynomials, Bollobás–Riordan polynomials, Bollobas–Riordan polynomial 
The Bollobás–Riordan polynomial can mean a 3-variable invariant polynomial of graphs on orientable surfaces, or a more general 4-variable invariant… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
We extend the quasi-tree expansion of A. Champanerkar, I. Kofman, and N. Stoltzfus to not necessarily orientable ribbon graphs… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
We define 2-decompositions of ribbon graphs, which generalise 2-sums and tensor products of graphs. We give formulae for the… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2011
2011
In [BR01], [BR02], Bollobás and Riordan generalized the classical Tutte polynomial to graphs cellularly embedded in surfaces, i.e… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
Recently S. Chmutov introduced a generalization of the dual of a ribbon graph (or equivalently an embedded graph) and proved a… (More)
  • figure 1
Is this relevant?
2009
2009
The coloured Tutte polynomial by Bollobás and Riordan is, as a generalization of the Tutte polynomial, the most general graph… (More)
Is this relevant?
2009
2009
We generalize the natural duality of graphs embedded into a surface to a duality with respect to a subset of edges. The dual… (More)
Is this relevant?
2008
2008
For a graph G embedded in an orientable surface Σ, we consider associated links L(G) in the thickened surface Σ × I. We relate… (More)
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
2008
2008
The Jones polynomial of an alternating link is a certain specialization of the Tutte polynomial of the (planar) checkerboard… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Consider G(n, p) to be the probability space of random graphs on n vertices with edge probability p. We will be considering… (More)
Is this relevant?