Fetching the paper…
Reading the bibliography…
We present a simple bijection between Baxter permutations of size $n$ and plane bipolar orientations with n edges.
On fixed points of the composite of commuting functions
G. Baxter · 1964
Earlier work this paper cites.
An algorithm for planarity testing of graphs
A. Lempel, S. Even, and I. Cederbaum · 1967
Earlier work this paper cites.
On the enumeration of tree-rooted maps
R. C. Mullin · 1967
Earlier work this paper cites.
Chromatic sums for rooted planar triangulations: the cases λ = 1 \lambda=1 and λ = 2 \lambda=2
W. T. Tutte · 1973
Earlier work this paper cites.
The number of Baxter permutations
F. R. K. Chung, R. L. Graham, V. E. Hoggatt, Jr., and M. Kleiman · 1978
Earlier work this paper cites.
Baxter permutations rise again
C. L. Mallows · 1979
Earlier work this paper cites.
A bijective proof for the number of Baxter permutations
G. Viennot · 1981
Earlier work this paper cites.
On the interpretation of Whitney numbers through arrangements of hyperplanes, zonotopes, non-Radon partitions, and orientations of graphs
C. Greene and T. Zaslavsky · 1983
Earlier work this paper cites.
Shuffle of parenthesis systems and Baxter permutations
R. Cori, S. Dulucq, and G. Viennot · 1986
Earlier work this paper cites.
Standard Young tableaux of height 4 4 and 5 5
D. Gouyou-Beauchamps · 1989
Earlier work this paper cites.
Area requirement and symmetry display of planar upward drawings
G. Di Battista, R. Tamassia, and I. G. Tollis · 1992
Earlier work this paper cites.
Arbres, permutations à motifs exclus et cartes planaires : quelques problèmes algorithmiques et combinatoires
S. Gire · 1993
Cited alongside, same era.
Sorting twice through a stack
J. West · 1993
Cited alongside, same era.
Orientations bipolaires
P. Ossona de Mendez · 1994
Cited alongside, same era.
Bipolar orientations revisited
H. de Fraysseix, P. Ossona de Mendez, and P. Rosenstiehl · 1995
Cited alongside, same era.
Generating trees and the Catalan and Schröder numbers
J. West · 1995
Cited alongside, same era.
Permutations with forbidden subsequences and nonseparable planar maps
S. Dulucq, S. Gire, and J. West · 1996
Cited alongside, same era.
Doubly alternating Baxter permutations are Catalan
O. Guibert and S. Linusson · 2000
Later among the works it cites.
Dichromatic polynomials and Potts models summed over rooted maps
R. J. Baxter · 2001
Later among the works it cites.
Orientations acycliques et le polynôme chromatique
B. Lass · 2001
Later among the works it cites.
Four classes of pattern-avoiding permutations under one roof: generating trees with two labels
M. Bousquet-Mélou · 2003
Later among the works it cites.
Bijective counting of tree-rooted maps and shuffles of parentheses systems
O. Bernardi · 2007
Later among the works it cites.
Enumeration and limit laws of series-parallel graphs
M. Bodirsky, O. Giménez, M. Kang, and M. Noy · 2007
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Dulucq and O. Guibert · 1996
Cited alongside, same era.
Exact enumeration of 1342 1342 -avoiding permutations: a close link with labeled trees and planar maps
M. Bóna · 1997
Cited alongside, same era.
Enumerative combinatorics. Vol. 2
R. P. Stanley · 1999
Cited alongside, same era.
Sinks in acyclic orientations of graphs
D. D. Gebhard and B. E. Sagan · 2000
Cited alongside, same era.
Bijections for baxter families and related objects
S. Felsner, É. Fusy, M. Noy, and D. Orden
Cited in the paper.
A proof of Julian West’s conjecture that the number of two-stack-sortable permutations of length n n is 2 ( 3 n ) ! / ( ( n + 1 ) ! ( 2 n + 1 ) ! ) 2(3n)!/((n+1)!(2n+1)!)
D. Zeilberger
Cited in the paper.
Forest-like permutations
M. Bousquet-Mélou and S. Butler · 2007
Later among the works it cites.
Bijective counting of plane bipolar orientations and Schnyder woods
É. Fusy, D. Poulalhon, and G. Schaeffer · 2007
Later among the works it cites.
Stack sorting, trees, and pattern avoidance
A. Claesson, S. Kitaev, and E. Steingrímsson · 2008
Closest in time.
Analytic Combinatorics
P. Flajolet and R. Sedgewick · 2008
Closest in time.