Feliú Sagols

Follow

Generating author description...

Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ Complexity: Knots, Colourings and Counting 1993 Dominic Welsh
1
+ Percolation and the Random Cluster Model: Combinatorial and Algorithmic Problems 1998 Dominic Welsh
1
+ Algebraic Graph Theory 1974 Norman Biggs
1
+ PDF Chat The multivariate Tutte polynomial (alias Potts model) for graphs and matroids 2005 Alan D. Sokal
1
+ Enumerative Combinatorics 1999 Richard P. Stanley
Sergey Fomin
1
+ PDF Chat A simple presentation of a group with unsolvable word problem 1986 Donald J. Collins
1
+ PDF Chat Exact Potts Model Partition Function for Strips of the Square Lattice 2002 Shu-Chiuan Chang
Jesús Salas
Robert Shrock
1
+ The Tutte Polynomial and Its Applications 1992 Thomas Brylawski
James Oxley
1
+ Edge-selection heuristics for computing Tutte polynomials 2009 David J. Pearce
Gary Haggard
Gordon Royle
1
+ Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes 2008 Petr Gregor
1
+ The Potts model and the Tutte polynomial 2000 Dominic Welsh
Criel Merino
1
+ Tilings and Patterns. 1988 Solomon W. Golomb
Branko Grünbaum
G. C. Shephard
1
+ Matrix multiplication via arithmetic progressions 1990 Don Coppersmith
S. Winograd
1
+ PDF Chat The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees 1990 David Aldous
1
+ Surveys in Combinatorics 2005 2005 B. S Webb
1
+ Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations 2008 Tomás Feder
Carlos Subi
1
+ Bounding the size of square-free subgraphs of the hypercube 2008 Andrew Thomason
Peter J. Papadakos
1
+ Computing Tutte Polynomials 2010 Gary Haggard
David J. Pearce
Gordon Royle
1
+ On the computational complexity of the Jones and Tutte polynomials 1990 François Jaeger
Dirk Vertigan
Dominic Welsh
1
+ A Survey of Combinatorial Gray Codes 1997 Carla D. Savage
1
+ Graph minors. X. Obstructions to tree-decomposition 1991 Neil Robertson
Paul Seymour
1
+ On some Tutte polynomial sequences in the square lattice 2011 Arun P. Mani
1
+ A note on short cycles in a hypercube 2006 Maria Axenovich
Ryan R. Martin
1
+ Perfect matchings extend to Hamilton cycles in hypercubes 2007 Jiří Fink
1
+ Generating random spanning trees 1989 Arndt Bröder
1
+ PDF Chat Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice 2003 Neil J. Calkin
Criel Merino
Steven D. Noble
Marc Noy
1
+ Computing the Tutte polynomial of a graph of moderate size 1995 Kyoko Sekine
Hiroshi Imai
Seiichiro Tani
1
+ Length-Based Attacks for Certain Group Based Encryption Rewriting Systems 2003 James P. Hughes
Allen Tannenbaum
1
+ Graph polynomials and Tutte-Grothendieck invariants: an application of elementary finite Fourier analysis 2008 Andrew Goodall
1
+ Edge-Selection Heuristics for Computing Tutte Polynomials. 2010 David J. Pearce
Gary Haggard
Gordon Royle
1
+ Symbolic Dynamics: One-sided, Two-sided and Countable State Markov Shifts 1997 Bruce Kitchens
1
+ Algebraic Graph Theory 2016 Michel Rigo
1
+ PDF Chat A Note on Graph Coloring Extensions and List-Colorings 2003 Maria Axenovich
1
+ PDF Chat Exact Potts Model Partition Functions for Strips of the Triangular Lattice 2004 Shu-Chiuan Chang
Jesper Lykke Jacobsen
Jesús Salas
Robert Shrock
1