Publications of Stéphan Thomassé
BACK TO COATI PUBLICATION INDEX
Publications of Stéphan Thomassé
-
Pierre Aboulker,
Nathann Cohen,
Frédéric Havet,
William Lochet,
Phablo F S Moura,
and Stéphan Thomassé.
Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number.
The Electronic Journal of Combinatorics,
26:P3.19,
July 2019.
[WWW
] [PDF
] [bibtex-entry]
-
Julien Bensmail,
Ararat Harutyunyan,
Tien-Nam Le,
and Stéphan Thomassé.
Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture.
Combinatorica,
39(2):239-263,
April 2019.
[WWW
] [PDF
] [bibtex-entry]
-
Nicolas Bousquet,
William Lochet,
and Stéphan Thomassé.
A proof of the Erdös--Sands--Sauer--Woodrow conjecture.
Journal of Combinatorial Theory, Series B,
137:316-319,
July 2019.
[WWW
] [PDF
]
Keywords:
Tournaments,
Domination,
Transitive digraphs.
[bibtex-entry]
-
Julien Bensmail,
Ararat Harutyunyan,
Tien-Nam Le,
and Stéphan Thomassé.
Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture.
Combinatorica,
2018.
[WWW
] [PDF
] [bibtex-entry]
-
Julien Bensmail,
Ararat Harutyunyan,
Tien-Nam Le,
Martin Merker,
and Stéphan Thomassé.
A Proof of the Barát--Thomassen Conjecture.
Journal of Combinatorial Theory, Series B,
124:39 - 55,
May 2017.
[WWW
] [PDF
]
Keywords:
large edge-connectivity,
Barát-Thomassen Conjecture,
tree-decomposition.
[bibtex-entry]
-
L. Addario-Berry,
F. Havet,
C. Linhares Sales,
B. Reed,
and S. Thomassé.
Oriented trees in digraphs.
Discrete Mathematics,
313(8):967-974,
2013.
[WWW
] [bibtex-entry]
-
D. Gonçalves,
F. Havet,
A. Pinlou,
and S. Thomassé.
On spanning galaxies in digraphs.
Discrete Applied Mathematics,
160(6):744-754,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
F. Havet,
F. Huc,
and S. Thomassé.
WDM and directed star arboricity.
Combinatorics, Probability and Computing,
19:161--182,
2010.
[PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
F. Mazoit,
N. Nisse,
and S. Thomassé.
Submodular partition functions.
Discrete Mathematics,
309(20):6000-6008,
2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Havet and S. Thomassé.
Complexity of $(p,1)$-total labelling.
Dicrete Applied Mathematics,
157:2859--2870,
2009.
[PDF
] [Abstract] [bibtex-entry]
-
F. Havet,
S. Thomassé,
and A. Yeo.
Hoang-Reed conjecture for tournaments.
Discrete Mathematics,
308(15):3412--3415,
August 2008.
[PDF
] [Abstract] [bibtex-entry]
-
L. Addario-Berry,
F. Havet,
and S. Thomassé.
Paths with two blocks in $n$-chromatic digraphs.
Journal of Combinatorial Theory Ser. B,
97:620--626,
2007.
[PDF
] [bibtex-entry]
-
P. Charbit,
S. Thomassé,
and A. Yeo.
The minimum feedback arc set problem is NP-hard for tournament.
Combinatorics, Probability and Computing,
16:1--4,
2007.
[bibtex-entry]
-
A. Bondy,
J. Shen,
S. Thomassé,
and C. Thomassen.
Density conditions for triangles in multipartite graphs.
Combinatorica,
26(2):121--131,
2006.
[bibtex-entry]
-
D. Gonçalves,
F. Havet,
A. Pinlou,
and S. Thomassé.
Spanning galaxies in digraphs.
In European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009),
volume 34 of Electronic Notes on Discrete Mathematics,
Bordeaux, France,
pages 139--143,
September 2009.
[PDF
] [Abstract] [bibtex-entry]
-
L. Addario-Berry,
O. Amini,
J.-S. Sereni,
and S. Thomassé.
Guarding art galleries: the extra cost for sculptures is linear.
In Proceedings of the Scandinavian Workshop on Algorithm Theory (SWAT 2008),
volume 5124 of Lecture Notes in Computer Science,
pages 41-52,
July 2008.
Springer.
[bibtex-entry]
-
S. Bessy and S. Thomassé.
Three min-max theorems concerning cyclic orders of strong digraphs.
In Acts of IPCO X 2004,
volume 3064 of Lecture Notes in Computer Sciences,
pages 132--138,
2004.
Springer-Verlag.
[WWW
] [bibtex-entry]
-
L. Addario-Berry,
F. Havet,
C. Linhares Sales,
B. Reed,
and S. Thomassé.
Oriented trees in digraphs.
Research Report 7502,
INRIA,
01 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
F. Havet,
F. Huc,
and S. Thomassé.
WDM and Directed Star Arboricity.
Research Report 6179,
INRIA,
January 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
F. Mazoit,
N. Nisse,
and S. Thomassé.
Submodular partition functions.
Technical report RR-1427-07,
LABRI, Univ. Bordeaux,
April 2007.
Note: Submitted in SIAM J. discrete Maths. [PDF
] [Abstract] [bibtex-entry]
-
F. Havet and S. Thomasse.
Complexity of $(p,1)$-total labelling.
Research Report 6305,
INRIA,
September 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Havet,
S. Thomassé,
and A. Yeo.
Hoàng-Reed conjecture holds for tournaments.
Research report,
INRIA Research Report 5976,
September 2006.
Note: Submitted Discrete Mathematics.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
L. Addario-Berry,
F. Havet,
and S. Thomassé.
Paths with two blocks in $n$-chromatic digraphs.
Research report,
INRIA Research Report 5688 and I3S Research Report I3S/RR-2005-27-FR,
2005.
[WWW
] [PDF
] [POSTSCRIPT
] [bibtex-entry]
-
Nicolas Bousquet,
William Lochet,
and Stéphan Thomassé.
A proof of the Erdos-Sands-Sauer-Woodrow conjecture.
Note: Working paper or preprint,
2017.
[WWW
]
Keywords:
Erdos-Sands-Sauer-Woodrow conjecture,
tournament,
dominating set.
[bibtex-entry]
BACK TO COATI PUBLICATION INDEX
Last modified: Sat Jan 29 19:00:47 2022
