#### Filter Results:

- Full text PDF available (14)

#### Publication Year

1948

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- P Aboulker, J M Sterkers, J E Demaldent
- Annales d'oto-laryngologie et de chirurgie…
- 1966

- P Frantz, P Aboulker, R Küss, A Jardin
- Journal d'urologie et de néphrologie
- 1977

In two cases of paraplegia due to an inondation of the intrarachidian plexus by venous blood from the left venal vein, we studied the frequency with which the renal-rachidian trunk connected the left renal vein and the intrarachidian plexus. We show in these rare cases how it is possible, with a simple procedure, the ligature of the renal-rachidian trunk,… (More)

- P Aboulker
- Problèmes actuels d'oto-rhino-laryngologie
- 1968

- Pierre Aboulker, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic
- SIAM J. Discrete Math.
- 2012

We recall several known results about minimally 2-connected graphs, and show that they all follow from a decomposition theorem. Starting from an analogy with critically 2-connected graphs, we give structural characterizations of the classes of graphs that do not contain as a subgraph and as an induced subgraph, a cycle with a node that has at least two… (More)

- Pierre Aboulker, Pierre Charbit, Nicolas Trotignon, Kristina Vuskovic
- Discrete Mathematics
- 2015

We provide a general method to prove the existence and compute efficiently elimination orderings in graphs. Our method relies on several tools that were known before, but that were not put together so far: the algorithm LexBFS due to Rose, Tarjan and Lueker, one of its properties discovered by Berry and Bordat, and a local decomposition property of graphs… (More)

A wheel is a graph formed by a chordless cycle and a vertex that has at least three neighbors in the cycle. We prove that every 3-connected graph that does not contain a wheel as a subgraph is in fact minimally 3-connected. We prove that every graph that does not contain a wheel as a subgraph is 3-colorable. Résumé : Une roue est un graph formé d'un cycle… (More)

- Pierre Aboulker, Marko Radovanovic, Nicolas Trotignon, Théophile Trunck, Kristina Vuskovic
- Journal of Graph Theory
- 2014

In [Structural properties and decomposition of linear balanced matrices , Mathematical Programming, 55:129–168, 1992], Conforti and Rao conjectured that every balanced bipartite graph contains an edge that is not the unique chord of a cycle. We prove this conjecture for balanced bipartite graphs that do not contain a cycle of length 4 (also known as linear… (More)

- Pierre Aboulker, John Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Vasek Chvátal, Peihan Miao
- Discrete Applied Mathematics
- 2014

- Pierre Aboulker, Maria Chudnovsky, Paul D. Seymour, Nicolas Trotignon
- Eur. J. Comb.
- 2015

A wheel is a graph formed by a chordless cycle C and a vertex u not in C that has at least three neighbors in C. We prove that every 3-connected planar graph that does not contain a wheel as an induced subgraph is either a line graph or has a clique cutset. We prove that every planar graph that does not contain a wheel as an induced subgraph is 3-colorable.… (More)

- Pierre Aboulker, Rohan Kapadia
- Eur. J. Comb.
- 2015

A classical theorem of Euclidean geometry asserts that any non-collinear set of n points in the plane determines at least n distinct lines. Chen and Chvátal conjectured a generalization of this result to arbitrary finite metric spaces, with a particular definition of lines in a metric space. We prove it for metric spaces induced by connected… (More)