The following pages link to Olivier Bernardi (Q286125):
Displaying 45 items.
- Some probabilistic trees with algebraic roots (Q286127) (← links)
- Bijections and symmetries for the factorizations of the long cycle (Q394753) (← links)
- Unified bijections for maps with prescribed degrees and girth (Q423656) (← links)
- Directed rooted forests in higher dimension (Q504966) (← links)
- A bijection for covered maps, or a shortcut between Harer-Zagiers and Jacksons formulas (Q543903) (← links)
- Counting unicellular maps on non-orientable surfaces (Q550259) (← links)
- A bijection between well-labelled positive paths and matchings (Q624822) (← links)
- A bijection for triangulations, quadrangulations, pentagulations, etc. (Q645974) (← links)
- An analogue of the Harer-Zagier formula for unicellular maps on general surfaces (Q651055) (← links)
- Enumerating simplicial decompositions of surfaces with boundaries (Q661938) (← links)
- Bijections for planar maps with boundaries (Q721046) (← links)
- Combinatorial reciprocity for the chromatic polynomial and the chromatic symmetric function (Q785786) (← links)
- Bijective counting of tree-rooted maps and shuffles of parenthesis systems (Q870065) (← links)
- On triangulations with high vertex degree (Q938208) (← links)
- A characterization of the Tutte polynomial via combinatorial embeddings (Q941619) (← links)
- Growth constants of minor-closed classes of graphs (Q974473) (← links)
- Intervals in Catalan lattices and realizers of triangulations (Q1003621) (← links)
- Tutte polynomial, subgraphs, orientations and sandpile model: new connections via embeddings (Q1010839) (← links)
- Deformations of the braid arrangement and trees (Q1669040) (← links)
- On the spanning trees of the hypercube and other products of graphs (Q1953363) (← links)
- Universal Tutte polynomial (Q2136561) (← links)
- Unified bijections for planar hypermaps with general cycle-length constraints (Q2176599) (← links)
- Counting colored planar maps: algebraicity results (Q2275895) (← links)
- Tutte polynomials for directed graphs (Q2284730) (← links)
- Counting coloured planar maps: differential equations (Q2364576) (← links)
- Bijective counting of Kreweras walks and loopless triangulations (Q2371300) (← links)
- A linear algorithm for the random sampling from regular languages (Q2428675) (← links)
- Schnyder decompositions for regular plane graphs and application to drawing (Q2429329) (← links)
- Counting trees using symmetries (Q2434888) (← links)
- Solution to a combinatorial puzzle arising from Mayer's theory of cluster integrals (Q2654622) (← links)
- (Q2789541) (← links)
- A Short Proof of Rayleigh’s Theorem with Extensions (Q2847003) (← links)
- (Q4591286) (← links)
- (Q4591317) (← links)
- A Boltzmann Approach to Percolation on Random Triangulations (Q4625176) (← links)
- Counting quadrant walks via Tutte's invariant method (Q5048440) (← links)
- Counting quadrant walks via Tutte's invariant method (extended abstract) (Q5111046) (← links)
- A bijection for plane graphs and its applications (Q5194756) (← links)
- A bijection for covered maps on orientable surfaces (Q5300983) (← links)
- Percolation on Triangulations, and a Bijective Path to Liouville Quantum Gravity (Q5377999) (← links)
- Separation Probabilities for Products of Permutations (Q5410255) (← links)
- Percolation on Triangulations: A Bijective Path to Liouville Quantum Gravity (Q6051919) (← links)
- Tutte polynomials for regular oriented matroids (Q6080143) (← links)
- A census of graph-drawing algorithms based on generalized transversal structures (Q6528103) (← links)
- A Schnyder-type drawing algorithm for 5-connected triangulations (Q6618254) (← links)
