A polynomial of graphs on surfaces

By Béla Bollobás, Oliver Riordan. 2002

177 citations recorded by the source corpus.

Subfields: Discrete Mathematics and Combinatorics, Geometry and Topology, Mathematical Physics

View Paper: https://www.semanticscholar.org/paper/de8a6120fa52d29494357a6b097c2505688cd8f9

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Discrete Mathematics and Combinatorics

1. Iain Moffatt
2. Adam S. Sikora
3. Martin Loebl
4. Bruce W. Westbury

In Geometry and Topology

1. Iain Moffatt
2. Adam S. Sikora
3. Martin Loebl
4. Bruce W. Westbury
5. Andrés Navas

In Mathematical Physics

1. Iain Moffatt
2. Adam S. Sikora
3. Martin Loebl
4. Bruce W. Westbury
5. Andrés Navas
6. Xuan Thinh Duong
7. T. Coulhon
8. Lixin Yan

Citations in the corpus

• Confluence Theory for Graphs (2006, methodology): “A generalization of dichromatic polynomial to ribbon graphs is considered by Bollobás and Riordan [6].”
• The chromatic polynomial of fatgraphs and its categorification (2005, background): “We prove that both our chromatic homology and the Khovanov homology of an associated link can be recovered from this categorification.”
• On the interplay between embedded graphs and delta‐matroids (2016, background): “The Bollobás–Riordan polynomial of a ribbon graph G, from [3, 4], is given by”