Bang-Jensen, Jørgen; Havet, Frédéric; Yeo, Anders Spanning Eulerian subdigraphs in semicomplete digraphs. (English) Zbl 1522.05155 J. Graph Theory 102, No. 3, 578-606 (2023). MSC: 05C20 05C85 05C40 05C45 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., J. Graph Theory 102, No. 3, 578--606 (2023; Zbl 1522.05155) Full Text: DOI arXiv OA License
Bang-Jensen, J.; Havet, F.; Kriesell, M.; Yeo, A. Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties. (English) Zbl 1522.05091 J. Graph Theory 99, No. 4, 615-636 (2022). MSC: 05C15 05C40 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., J. Graph Theory 99, No. 4, 615--636 (2022; Zbl 1522.05091) Full Text: DOI arXiv
Cohen, Nathann; Havet, Frédéric; Lochet, William; Nisse, Nicolas Subdivisions of oriented cycles in digraphs with large chromatic number. (English) Zbl 1484.05083 J. Graph Theory 89, No. 4, 439-456 (2018). MSC: 05C20 05C38 05C15 PDFBibTeX XMLCite \textit{N. Cohen} et al., J. Graph Theory 89, No. 4, 439--456 (2018; Zbl 1484.05083) Full Text: DOI arXiv
Cohen, Nathann; Havet, Frédéric; Lochet, William; Lopes, Raul Bispindles in strongly connected digraphs with large chromatic number. (English) Zbl 1388.05077 Electron. J. Comb. 25, No. 2, Research Paper P2.39, 19 p. (2018). MSC: 05C20 05C15 05C40 PDFBibTeX XMLCite \textit{N. Cohen} et al., Electron. J. Comb. 25, No. 2, Research Paper P2.39, 19 p. (2018; Zbl 1388.05077) Full Text: Link
Cohen, Nathann; Havet, Frédéric; Lochet, William; Lopes, Raul Bispindle in strongly connected digraphs with large chromatic number. (English) Zbl 1383.05128 Bassino, Frédérique (ed.) et al., LAGOS 2017. Selected papers of the 9th Latin-American algorithms, graphs, and optimization symposium, Marseille, France, September 11–15, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 62, 69-74 (2017). MSC: 05C20 05C40 05C15 PDFBibTeX XMLCite \textit{N. Cohen} et al., Electron. Notes Discrete Math. 62, 69--74 (2017; Zbl 1383.05128) Full Text: DOI arXiv Link
Bang-Jensen, J.; Cohen, Nathann; Havet, Frédéric Finding good 2-partitions of digraphs. II. Enumerable properties. (English) Zbl 1345.68168 Theor. Comput. Sci. 640, 1-19 (2016). MSC: 68Q25 05C20 05C70 68Q17 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Theor. Comput. Sci. 640, 1--19 (2016; Zbl 1345.68168) Full Text: DOI
Bang-Jensen, J.; Havet, Frédéric Finding good 2-partitions of digraphs. I. Hereditary properties. (English) Zbl 1342.68150 Theor. Comput. Sci. 636, 85-94 (2016). MSC: 68Q25 05C20 05C70 68Q17 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{F. Havet}, Theor. Comput. Sci. 636, 85--94 (2016; Zbl 1342.68150) Full Text: DOI
Havet, Frédéric; Thomassé, Stéphan; Yeo, Anders Hoàng-Reed conjecture holds for tournaments. (English) Zbl 1147.05038 Discrete Math. 308, No. 15, 3412-3415 (2008). Reviewer: Wai-Kai Chen (Fremont) MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{F. Havet} et al., Discrete Math. 308, No. 15, 3412--3415 (2008; Zbl 1147.05038) Full Text: DOI
Addario-Berry, L.; Havet, F.; Thomassé, S. Paths with two blocks in \(n\)-chromatic digraphs. (English) Zbl 1119.05049 J. Comb. Theory, Ser. B 97, No. 4, 620-626 (2007). Reviewer: Hans Peter Künzi (Rondebosch) MSC: 05C20 05C15 05C38 PDFBibTeX XMLCite \textit{L. Addario-Berry} et al., J. Comb. Theory, Ser. B 97, No. 4, 620--626 (2007; Zbl 1119.05049) Full Text: DOI
Bessy, S.; Havet, F.; Birmelé, E. Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree. (English) Zbl 1116.05025 J. Graph Theory 53, No. 4, 315-332 (2006). Reviewer: Reinhardt Euler (Brest) MSC: 05C15 05C20 PDFBibTeX XMLCite \textit{S. Bessy} et al., J. Graph Theory 53, No. 4, 315--332 (2006; Zbl 1116.05025) Full Text: DOI
Havet, Frédéric Trees in tournaments. (English) Zbl 0995.05037 Discrete Math. 243, No. 1-3, 121-134 (2002). Reviewer: Wai-Kai Chen (Chicago) MSC: 05C05 05C20 PDFBibTeX XMLCite \textit{F. Havet}, Discrete Math. 243, No. 1--3, 121--134 (2002; Zbl 0995.05037) Full Text: DOI