12 citations · 34 across the 9 of their papers we have counts for
9 papers
A combinatorial proof of a symmetry for a refinement of the Narayana numbers
Miklós Bóna, Stoyan Dimitrov, Gilbert Labelle +4
We establish a tantalizing symmetry of certain numbers refining the Narayana numbers. In terms of Dyck paths, this symmetry is interpreted in the following way: if is t…
Two-connected graphs with prescribed three-connected components
Andrei Gagarin, Gilbert Labelle, Pierre Leroux +1
We adapt the classical 3-decomposition of any 2-connected graph to the case of simple graphs (no loops or multiple edges). By analogy with the block-cutpoint tree of a connected gr…
Discrete sets with minimal moment of inertia
S. Brlek, G. Labelle, A. Lacasse
This paper has been withdrawn by the author due to a crucial error in the proof of Theorem 1.
Counting unlabelled toroidal graphs with no K33-subdivisions
Andrei Gagarin, Gilbert Labelle, Pierre Leroux
We provide a description of unlabelled enumeration techniques, with complete proofs, for graphs that can be canonically obtained by substituting 2-pole networks for the edges of co…
Characterization and enumeration of toroidal K_{3,3}-subdivision-free graphs
Andrei Gagarin, Gilbert Labelle, Pierre Leroux
We describe the structure of 2-connected non-planar toroidal graphs with no K_{3,3}-subdivisions, using an appropriate substitution of planar networks into the edges of certain gra…
The structure and labelled enumeration of K_{3,3}-subdivision-free projective-planar graphs
Andrei Gagarin, Gilbert Labelle, Pierre Leroux
We consider the class F of 2-connected non-planar K_{3,3}-subdivision-free graphs that are embeddable in the projective plane. We show that these graphs admit a unique decompositio…