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
Bang-Jensen, Jørgen; Bessy, Stéphane; Havet, Frédéric; Yeo, Anders Arc-disjoint in- and out-branchings in digraphs of independence number at most 2. (English) Zbl 1522.05154 J. Graph Theory 100, No. 2, 294-314 (2022). MSC: 05C20 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., J. Graph Theory 100, No. 2, 294--314 (2022; Zbl 1522.05154) Full Text: DOI arXiv
Havet, Frédéric; Reed, Bruce; Stein, Maya; Wood, David R. A variant of the Erdős-Sós conjecture. (English) Zbl 1495.05144 J. Graph Theory 94, No. 1, 131-158 (2020). MSC: 05C35 05C07 PDFBibTeX XMLCite \textit{F. Havet} et al., J. Graph Theory 94, No. 1, 131--158 (2020; Zbl 1495.05144) Full Text: DOI arXiv
Bang-Jensen, J.; Bessy, S.; Havet, F.; Yeo, A. Bipartite spanning sub(di)graphs induced by 2-partitions. (English) Zbl 1425.05127 J. Graph Theory 92, No. 2, 130-151 (2019). MSC: 05C70 05C45 05C07 05C40 05C20 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., J. Graph Theory 92, No. 2, 130--151 (2019; Zbl 1425.05127) 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
Aboulker, P.; Bang-jensen, J.; Bousquet, N.; Charbit, P.; Havet, F.; Maffray, F.; Zamora, J. \(\chi\)-bounded families of oriented graphs. (English) Zbl 1410.05173 J. Graph Theory 89, No. 3, 304-326 (2018). Reviewer: Margherita Maria Ferrari (Tampa) MSC: 05C75 05C15 PDFBibTeX XMLCite \textit{P. Aboulker} et al., J. Graph Theory 89, No. 3, 304--326 (2018; Zbl 1410.05173) Full Text: DOI arXiv Link
Havet, Frédéric; Maia, A. Karolinna; Mohar, Bojan Finding a subdivision of a prescribed digraph of order 4. (English) Zbl 1386.05075 J. Graph Theory 87, No. 4, 536-560 (2018). MSC: 05C20 68Q25 PDFBibTeX XMLCite \textit{F. Havet} et al., J. Graph Theory 87, No. 4, 536--560 (2018; Zbl 1386.05075) Full Text: DOI arXiv
Aboulker, Pierre; Brettell, Nick; Havet, Frédéric; Marx, Dániel; Trotignon, Nicolas Coloring graphs with constraints on connectivity. (English) Zbl 1368.05040 J. Graph Theory 85, No. 4, 814-838 (2017). MSC: 05C15 05C40 05C35 05C07 68Q17 PDFBibTeX XMLCite \textit{P. Aboulker} et al., J. Graph Theory 85, No. 4, 814--838 (2017; Zbl 1368.05040) Full Text: DOI arXiv Link
Campos, Victor; Gyárfás, András; Havet, Frédéric; Sales, Claudia Linhares; Maffray, Frédéric New bounds on the Grundy number of products of graphs. (English) Zbl 1248.05173 J. Graph Theory 71, No. 1, 78-88 (2012). MSC: 05C76 05C15 PDFBibTeX XMLCite \textit{V. Campos} et al., J. Graph Theory 71, No. 1, 78--88 (2012; Zbl 1248.05173) Full Text: DOI HAL
Havet, Frédéric; Jendrol’, Stanislav; Soták, Roman; Škrabuľáková, Erika Facial non-repetitive edge-coloring of plane graphs. (English) Zbl 1222.05059 J. Graph Theory 66, No. 1, 38-48 (2011). MSC: 05C15 05C10 05C05 PDFBibTeX XMLCite \textit{F. Havet} et al., J. Graph Theory 66, No. 1, 38--48 (2011; Zbl 1222.05059) Full Text: DOI Link
Havet, Frédéric; Kang, Ross J.; Müller, Tobias; Sereni, Jean-Sébastien Circular choosability. (English) Zbl 1180.05044 J. Graph Theory 61, No. 4, 241-270 (2009). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C15 PDFBibTeX XMLCite \textit{F. Havet} et al., J. Graph Theory 61, No. 4, 241--270 (2009; Zbl 1180.05044) Full Text: DOI Link
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; Sereni, Jean-Sébastien Improper choosability of graphs and maximum average degree. (English) Zbl 1104.05026 J. Graph Theory 52, No. 3, 181-199 (2006). Reviewer: Gerd Wegner (Dortmund) MSC: 05C15 PDFBibTeX XMLCite \textit{F. Havet} and \textit{J.-S. Sereni}, J. Graph Theory 52, No. 3, 181--199 (2006; Zbl 1104.05026) Full Text: DOI Link
Havet, F. Pancyclic arcs and connectivity in tournaments. (English) Zbl 1060.05037 J. Graph Theory 47, No. 2, 87-110 (2004). Reviewer: J. W. Moon (Edmonton) MSC: 05C20 05C75 05C38 PDFBibTeX XMLCite \textit{F. Havet}, J. Graph Theory 47, No. 2, 87--110 (2004; Zbl 1060.05037) Full Text: DOI Link
Havet, Frédéric; Thomassé, Stéphan Median orders of tournaments: A tool for the second neighborhood problem and Sumner’s conjecture. (English) Zbl 0969.05029 J. Graph Theory 35, No. 4, 244-256 (2000). Reviewer: Matúš Harminc (Košice) MSC: 05C20 PDFBibTeX XMLCite \textit{F. Havet} and \textit{S. Thomassé}, J. Graph Theory 35, No. 4, 244--256 (2000; Zbl 0969.05029) Full Text: DOI