Théophile Trunck
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Théophile Trunck has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Nicolas Trotignon
Univ Lyon, EnsL, UCBL, CNRS, LIP, F-69342, LYON Cedex 07, France
2 shared publications - Pierre Aboulker
Université Paris 7 LIAFA 7014 75205 Paris Cedex 13 Case France
2 shared publications - Aurélie Lagoutte
LIP UMR 5668 ENS Lyon -CNRS -UCBL -INRIA Université de Lyon 46, allée de l'Italie 69364 Lyon France
1 shared publication - Daniël Paulusma
Durham University, Durham, UK
1 shared publication - Jean-Florent Raymond
CNRS, LIMOS, Université Clermont Auvergne, France
1 shared publication - Kristina Vušković
School of Computing, University of Leeds, Leeds LS2 9JT, United Kingdom
1 shared publication
Latest Publications
- Open Access
Multigraphs without large bonds are wqo by contraction
We show that the class of multigraphs with at most $p$ connected components and bonds of size at most $k$ is well-quasi-ordered by edge contraction for all positive integers $p,k$. (A bond is a minimal non-empty edge cut.) We also characterize canonical antichains for this relation and show that they are fundamental.Open AccessMultigraphs without large bonds are wqo by contraction
We show that the class of multigraphs with at most $p$ connected components and bonds of size at most $k$ is well-quasi-ordered by edge contraction for all positive integers $p,k$. (A bond is a minimal non-empty edge cut.) We also characterize canonical antichains for this relation and show that they are fundamental. - 1 June 2016
- Published by Elsevier in Discrete Mathematics
- Vol. 339 (6) , 1809-1825
Clique–Stable Set separation in perfect graphs with no balanced skew-partitions
- 1 June 2016
- Published by Elsevier in Discrete Mathematics
- Vol. 339 (6) , 1809-1825
Clique–Stable Set separation in perfect graphs with no balanced skew-partitions
- 7 December 2013
- Published by Springer Nature in Theory of Computing Systems
- Vol. 54 (2) , 244-260
Obtaining Online Ecological Colourings by Generalizing First-Fit
- 7 December 2013
- Published by Springer Nature in Theory of Computing Systems
- Vol. 54 (2) , 244-260
Obtaining Online Ecological Colourings by Generalizing First-Fit
- Open Access
Linear balanceable and subcubic balanceable graphs
In [{Structural properties and decomposition of linear balanced matrices}, {\it 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 balanced bipartite graphs), and for balanced bipartite graphs whose maximum degree is at most 3. We in fact obtain results for more general classes, namely linear balanceable and subcubic balanceable graphs. Additionally, we prove that cubic balanced graphs contain a pair of twins, a result that was conjectured by Morris, Spiga and Webb in [Balanced Cayley graphs and balanced planar graphs, {\it Discrete Mathematics}, 310:3228--3235, 2010].
Open AccessLinear balanceable and subcubic balanceable graphs
In [{Structural properties and decomposition of linear balanced matrices}, {\it 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 balanced bipartite graphs), and for balanced bipartite graphs whose maximum degree is at most 3. We in fact obtain results for more general classes, namely linear balanceable and subcubic balanceable graphs. Additionally, we prove that cubic balanced graphs contain a pair of twins, a result that was conjectured by Morris, Spiga and Webb in [Balanced Cayley graphs and balanced planar graphs, {\it Discrete Mathematics}, 310:3228--3235, 2010].
- 14 February 2013
- Published by Wiley in Journal of Graph Theory
- Vol. 75 (2) , 150-166
Linear Balanceable and Subcubic Balanceable Graphs*
- 14 February 2013
- Published by Wiley in Journal of Graph Theory
- Vol. 75 (2) , 150-166
Linear Balanceable and Subcubic Balanceable Graphs*