default search action
Frédéric Havet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j107]Jonas Costa Ferreira da Silva, Frédéric Havet
:
On b-greedy colourings and z-colourings. Discret. Appl. Math. 359: 250-268 (2024) - [j106]Nicolas Bousquet, Frédéric Havet, Nicolas Nisse, Lucas Picasarri-Arrieta, Amadeus Reinald
Digraph redicolouring. Eur. J. Comb. 116: 103876 (2024) - [j105]Pierre Aboulker, Thomas Bellitto, Frédéric Havet, Clément Rambaud:
On the Minimum Number of Arcs in \(\boldsymbol{k}\)-Dicritical Oriented Graphs. SIAM J. Discret. Math. 38(2): 1863-1901 (2024) - [i20]Pierre Aboulker, Frédéric Havet, François Pirot, Juliette Schabanel:
Minimum acyclic number and maximum dichromatic number of oriented triangle-free graphs of a given order. CoRR abs/2403.02298 (2024) - [i19]Frédéric Havet, Florian Hörsch, Clément Rambaud:
Diameter of the inversion graph. CoRR abs/2405.04119 (2024) - 2023
- [j104]Júlio Araújo
On Finding the Best and Worst Orientations for the Metric Dimension. Algorithmica 85(10): 2962-3002 (2023) - [j103]Jørgen Bang-Jensen
Spanning eulerian subdigraphs in semicomplete digraphs. J. Graph Theory 102(3): 578-606 (2023) - [c14]J. Araujo, Frédéric Havet, Cláudia Linhares Sales, Nicolas Nisse, Karol Suchan
Semi-proper orientations of dense graphs. LAGOS 2023: 231-240 - [c13]Frédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud:
On the Minimum Number of Arcs in 4-Dicritical Oriented Graphs. WG 2023: 376-387 - [i18]Nicolas Bousquet, Frédéric Havet, Nicolas Nisse, Lucas Picasarri-Arrieta, Amadeus Reinald:
Digraph redicolouring. CoRR abs/2301.03417 (2023) - [i17]Julien Duron, Frédéric Havet, Florian Hörsch, Clément Rambaud:
On the minimum number of inversions to make a digraph k-(arc-)strong. CoRR abs/2303.11719 (2023) - [i16]Frédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud:
On the minimum number of arcs in 4-dicritical oriented graphs. CoRR abs/2306.10784 (2023) - [i15]Stéphane Bessy, Frédéric Havet, Lucas Picasarri-Arrieta:
Dichromatic number of chordal graphs. CoRR abs/2309.17385 (2023) - 2022
- [j102]Pierre Aboulker, Frédéric Havet, Kolja Knauer, Clément Rambaud:
On the Dichromatic Number of Surfaces. Electron. J. Comb. 29(1) (2022) - [j101]Frédéric Havet
On the Nash number and the diminishing Grundy number of a graph. Discret. Appl. Math. 314: 1-16 (2022) - [j100]Frédéric Havet
Overlaying a hypergraph with a graph with bounded maximum degree. Discret. Appl. Math. 319: 394-406 (2022) - [j99]Jørgen Bang-Jensen
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties. J. Graph Theory 99(4): 615-636 (2022) - [j98]Jørgen Bang-Jensen
Arc-disjoint in- and out-branchings in digraphs of independence number at most 2. J. Graph Theory 100(2): 294-314 (2022) - [c12]Jean-Claude Bermond, Frédéric Havet, Michel Cosnard:
Grabbing Olives on Linear Pizzas and Pissaladières. FUN 2022: 12:1-12:20 - [i14]Pierre Aboulker, Thomas Bellitto, Frédéric Havet, Clément Rambaud:
On the minimum number of arcs in k-dicritical oriented graphs. CoRR abs/2207.01051 (2022) - [i13]Guillaume Aubian, Frédéric Havet, Florian Hörsch, Felix Klingelhöfer, Nicolas Nisse, Clément Rambaud, Quentin Vermande:
Problems, proofs, and disproofs on the inversion number. CoRR abs/2212.09188 (2022) - 2021
- [j97]Nemanja Draganic
Powers of paths in tournaments. Comb. Probab. Comput. 30(6): 894-898 (2021) - [j96]Ali Dehghan
On the semi-proper orientations of graphs. Discret. Appl. Math. 296: 9-25 (2021) - [j95]Jørgen Bang-Jensen, Jonas Costa Ferreira da Silva, Frédéric Havet:
On the inversion number of oriented graphs. Discret. Math. Theor. Comput. Sci. 23(2) (2021) - [j94]François Dross, Frédéric Havet
On the unavoidability of oriented trees. J. Comb. Theory B 151: 83-110 (2021) - [i12]Pierre Aboulker, Frédéric Havet, Kolja Knauer, Clément Rambaud:
On the dichromatic number of surfaces. CoRR abs/2102.01034 (2021) - [i11]Jørgen Bang-Jensen, Jonas Costa Ferreira da Silva, Frédéric Havet:
On the inversion number of oriented graphs. CoRR abs/2105.04137 (2021) - 2020
- [j93]Ron Aharoni, Eli Berger, Maria Chudnovsky
Cooperative Colorings of Trees and of Bipartite Graphs. Electron. J. Comb. 27(1): 1 (2020) - [j92]Louigi Addario-Berry, Maria Chudnovsky
Corrigendum to "Bisimplicial vertices in even-hole-free graphs". J. Comb. Theory B 142: 374-375 (2020) - [j91]Frédéric Havet
A variant of the Erdős-Sós conjecture. J. Graph Theory 94(1): 131-158 (2020) - [c11]Jørgen Bang-Jensen, Jonas Costa Ferreira da Silva, Frédéric Havet:
Inversion number of an oriented graph and related parameters. ALGOS 2020: 101-121 - [c10]Frédéric Havet
Overlaying a Hypergraph with a Graph with Bounded Maximum Degree. CALDAM 2020: 403-414
2010 – 2019
- 2019
- [j90]Pierre Aboulker, Nathann Cohen, Frédéric Havet, William Lochet, Phablo F. S. Moura
Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number. Electron. J. Comb. 26(3): 3 (2019) - [j89]Julien Bensmail, Thibaut Blanc, Nathann Cohen, Frédéric Havet, Leonardo S. Rocha:
Backbone colouring and algorithms for TDMA scheduling. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - [j88]Frédéric Havet, Nicolas Nisse:
Constrained ear decompositions in graphs and digraphs. Discret. Math. Theor. Comput. Sci. 21(4) (2019) - [j87]Jørgen Bang-Jensen
Bipartite spanning sub(di)graphs induced by 2-partitions. J. Graph Theory 92(2): 130-151 (2019) - [c9]François Dross, Frédéric Havet:
On the Unavoidability of Oriented Trees. LAGOS 2019: 425-436 - [i10]Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo:
Spanning eulerian subdigraphs in semicomplete digraphs. CoRR abs/1905.11019 (2019) - 2018
- [j86]Frédéric Giroire
On the Complexity of Compressing Two Dimensional Routing Tables with Order. Algorithmica 80(1): 209-233 (2018) - [j85]Nathann Cohen, Frédéric Havet:
On the Minimum Size of an Identifying Code Over All Orientations of a Graph. Electron. J. Comb. 25(1): 1 (2018) - [j84]Nathann Cohen, Frédéric Havet, William Lochet
Bispindles in Strongly Connected Digraphs with Large Chromatic Number. Electron. J. Comb. 25(2): 2 (2018) - [j83]Júlio Araújo
Steinberg-like theorems for backbone colouring. Discret. Appl. Math. 245: 155-167 (2018) - [j82]Rennan Dantas, Frédéric Havet
Minimum density of identifying codes of king grids. Discret. Math. 341(10): 2708-2719 (2018) - [j81]Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau
Complexity dichotomies for the MinimumF-Overlay problem. J. Discrete Algorithms 52-53: 133-142 (2018) - [j80]Frédéric Havet, Ana Karolinna Maia
Finding a subdivision of a prescribed digraph of order 4. J. Graph Theory 87(4): 536-560 (2018) - [j79]Pierre Aboulker
χ-bounded families of oriented graphs. J. Graph Theory 89(3): 304-326 (2018) - [j78]Nathann Cohen, Frédéric Havet
Subdivisions of oriented cycles in digraphs with large chromatic number. J. Graph Theory 89(4): 439-456 (2018) - [j77]Jørgen Bang-Jensen
Out-degree reducing partitions of digraphs. Theor. Comput. Sci. 719: 64-72 (2018) - [p1]Jørgen Bang-Jensen
Tournaments and Semicomplete Digraphs. Classes of Directed Graphs 2018: 35-124 - [i9]François Dross, Frédéric Havet:
On the unavoidability of oriented trees. CoRR abs/1812.05167 (2018) - 2017
- [j76]Rennan Dantas, Frédéric Havet, Rudini M. Sampaio
Identifying codes for infinite triangular grids with a finite number of rows. Discret. Math. 340(7): 1584-1597 (2017) - [j75]Rennan Dantas, Rudini M. Sampaio, Frédéric Havet:
Minimum density of identifying codes of king grids. Electron. Notes Discret. Math. 62: 51-56 (2017) - [j74]Nathann Cohen, Frédéric Havet, William Lochet, Raul Lopes:
Bispindle in strongly connected digraphs with large chromatic number. Electron. Notes Discret. Math. 62: 69-74 (2017) - [j73]Pierre Aboulker, Nick Brettell
Coloring Graphs with Constraints on Connectivity. J. Graph Theory 85(4): 814-838 (2017) - [c8]Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant:
Complexity Dichotomies for the Minimum ℱ -Overlay Problem. IWOCA 2017: 116-127 - [i8]Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau
Complexity Dichotomies for the Minimum F-Overlay Problem. CoRR abs/1703.05156 (2017) - [i7]Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo:
Out-degree reducing partitions of digraphs. CoRR abs/1707.09349 (2017) - [i6]Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo:
Bipartite spanning sub(di)graphs induced by 2-partitions. CoRR abs/1707.09400 (2017) - 2016
- [j72]Jørgen Bang-Jensen
The complexity of finding arc-disjoint branching flows. Discret. Appl. Math. 209: 16-26 (2016) - [j71]Frédéric Giroire, Frédéric Havet, Joanna Moulierac:
Compressing Two-dimensional Routing Tables with Order. Electron. Notes Discret. Math. 52: 351-358 (2016) - [j70]Jørgen Bang-Jensen
Finding good 2-partitions of digraphs I. Hereditary properties. Theor. Comput. Sci. 636: 85-94 (2016) - [j69]Júlio Araújo
Proper orientation of cacti. Theor. Comput. Sci. 639: 14-25 (2016) - [j68]Jørgen Bang-Jensen
Finding good 2-partitions of digraphs II. Enumerable properties. Theor. Comput. Sci. 640: 1-19 (2016) - [c7]Marwane Bouznif
Minimum-Density Identifying Codes in Square Grids. AAIM 2016: 77-88 - [i5]Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora:
$χ$-bounded families of oriented graphs. CoRR abs/1605.07411 (2016) - 2015
- [j67]Júlio Araújo
Steinberg-like theorems for backbone colouring. Electron. Notes Discret. Math. 50: 223-229 (2015) - [j66]Frédéric Havet, Ana Karolinna Maia, Min-Li Yu:
Complexity of greedy edge-colouring. J. Braz. Comput. Soc. 21(1): 18:1-18:7 (2015) - [j65]Olivier Delmas, Frédéric Havet, Mickaël Montassier, Stéphane Pérennes:
Design of fault-tolerant on-board networks with variable switch sizes. Theor. Comput. Sci. 562: 75-89 (2015) - [j64]Jørgen Bang-Jensen
Finding a subdivision of a digraph. Theor. Comput. Sci. 562: 283-303 (2015) - [j63]Júlio Araújo
On the proper orientation number of bipartite graphs. Theor. Comput. Sci. 566: 59-75 (2015) - [i4]Pierre Aboulker, Nick Brettell, Frédéric Havet, Dániel Marx, Nicolas Trotignon:
Colouring graphs with constraints on connectivity. CoRR abs/1505.01616 (2015) - 2014
- [j62]Frédéric Havet, Andrew D. King, Mathieu Liedloff, Ioan Todinca:
(Circular) backbone colouring: Forest backbones in planar graphs. Discret. Appl. Math. 169: 119-134 (2014) - [j61]Frédéric Havet
List circular backbone colouring. Discret. Math. Theor. Comput. Sci. 16(1): 89-104 (2014) - [j60]Frédéric Havet
Detection number of bipartite graphs and cubic graphs. Discret. Math. Theor. Comput. Sci. 16(3): 333-342 (2014) - 2013
- [j59]Frédéric Havet, Leonardo Sampaio Rocha
On the Grundy and b-Chromatic Numbers of a Graph. Algorithmica 65(4): 885-899 (2013) - [j58]Sylvain Guillemot, Frédéric Havet, Christophe Paul
On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification Problems. Algorithmica 65(4): 900-926 (2013) - [j57]Louigi Addario-Berry, Frédéric Havet, Cláudia Linhares Sales
Oriented trees in digraphs. Discret. Math. 313(8): 967-974 (2013) - [j56]Stéphane Bessy, Frédéric Havet:
Enumerating the edge-colourings and total colourings of a regular graph. J. Comb. Optim. 25(4): 523-535 (2013) - [j55]Frédéric Havet, Xuding Zhu:
The game Grundy number of graphs. J. Comb. Optim. 25(4): 752-765 (2013) - [j54]Victor A. Campos, Frédéric Havet, Rudini Menezes Sampaio
Backbone colouring: Tree backbones with small diameter in planar graphs. Theor. Comput. Sci. 487: 50-64 (2013) - [i3]Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon:
Finding an induced subdivision of a digraph. CoRR abs/1309.1553 (2013) - 2012
- [j53]Daniel Gonçalves
On spanning galaxies in digraphs. Discret. Appl. Math. 160(6): 744-754 (2012) - [j52]Júlio Araújo
Good edge-labelling of graphs. Discret. Appl. Math. 160(18): 2502-2513 (2012) - [j51]Frédéric Havet, Cláudia Linhares Sales
b-coloring of tight graphs. Discret. Appl. Math. 160(18): 2709-2715 (2012) - [j50]Júlio Araújo
Weighted improper colouring. J. Discrete Algorithms 16: 53-66 (2012) - [j49]Victor A. Campos, András Gyárfás, Frédéric Havet, Cláudia Linhares Sales
New Bounds on the Grundy Number of Products of Graphs. J. Graph Theory 71(1): 78-88 (2012) - [j48]Frédéric Havet, Bruce A. Reed, Jean-Sébastien Sereni:
Griggs and Yeh's Conjecture and L(p, 1)-labelings. SIAM J. Discret. Math. 26(1): 145-168 (2012) - [j47]Jørgen Bang-Jensen
Finding an induced subdivision of a digraph. Theor. Comput. Sci. 443: 10-24 (2012) - 2011
- [j46]Frédéric Havet, Martin Klazar
Exact Algorithms for L(2, 1)-Labeling of Graphs. Algorithmica 59(2): 169-194 (2011) - [j45]Jørgen Bang-Jensen
Finding an induced subdivision of a digraph. Electron. Notes Discret. Math. 37: 9-14 (2011) - [j44]Nathann Cohen, Frédéric Havet:
Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree. Graphs Comb. 27(6): 831-849 (2011) - [j43]Frédéric Havet, Stanislav Jendrol'
Facial non-repetitive edge-coloring of plane graphs. J. Graph Theory 66(1): 38-48 (2011) - [j42]Rok Erman, Frédéric Havet, Bernard Lidický
5-Coloring Graphs with 4 Crossings. SIAM J. Discret. Math. 25(1): 401-422 (2011) - [j41]Manu Basavaraju, L. Sunil Chandran, Nathann Cohen, Frédéric Havet, Tobias Müller:
Acyclic Edge-Coloring of Planar Graphs. SIAM J. Discret. Math. 25(2): 463-478 (2011) - [c6]Júlio Araújo
Weighted Improper Colouring. IWOCA 2011: 1-18 - 2010
- [j40]Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé:
WDM and Directed Star Arboricity. Comb. Probab. Comput. 19(2): 161-182 (2010) - [j39]Nicole Eggemann, Frédéric Havet, Steven D. Noble
k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4. Discret. Appl. Math. 158(16): 1777-1788 (2010) - [j38]Marie Asté, Frédéric Havet, Cláudia Linhares Sales
Grundy number and products of graphs. Discret. Math. 310(9): 1482-1490 (2010) - [j37]Frédéric Havet, Min-Li Yu:
Corrigendum to "(p, 1)-total labelling of graphs" [Discrete Mathematics 308 (2008) 496-513]. Discret. Math. 310(15-16): 2219-2220 (2010) - [j36]Nathann Cohen, Frédéric Havet:
Planar graphs with maximum degree Delta>=9 are (Delta+1)-edge-choosable - A short proof. Discret. Math. 310(21): 3049-3051 (2010) - [j35]Jean-Claude Bermond, Frédéric Havet, Florian Huc, Cláudia Linhares Sales
Improper Coloring of Weighted Grid and Hexagonal Graphs. Discret. Math. Algorithms Appl. 2(3): 395-412 (2010) - [j34]Frédéric Havet, Daniel Král'
Facial colorings using Hall's Theorem. Eur. J. Comb. 31(3): 1001-1019 (2010) - [c5]Frédéric Havet, Leonardo Sampaio Rocha
On the Grundy Number of a Graph. IPEC 2010: 170-179
2000 – 2009
- 2009
- [j33]Ricardo C. Corrêa, Frédéric Havet, Jean-Sébastien Sereni:
About a Brooks-type theorem for improper colouring. Australas. J Comb. 43: 219-230 (2009) - [j32]Frédéric Havet, Stéphan Thomassé:
Complexity of (p, 1)-total labelling. Discret. Appl. Math. 157(13): 2859-2870 (2009) - [j31]Frédéric Havet:
Choosability of the square of planar subcubic graphs with large girth. Discret. Math. 309(11): 3553-3563 (2009) - [j30]Daniel Gonçalves
Spanning galaxies in digraphs. Electron. Notes Discret. Math. 34: 139-143 (2009) - [j29]Nathann Cohen, Frédéric Havet, Tobias Müller:
Acyclic edge-colouring of planar graphs. Extended abstract. Electron. Notes Discret. Math. 34: 417-421 (2009) - [j28]Júlio Araújo
Good edge-labelling of graphs. Electron. Notes Discret. Math. 35: 275-280 (2009) - [j27]Frédéric Havet, Ross J. Kang
Circular choosability. J. Graph Theory 61(4): 241-270 (2009) - [j26]Frédéric Havet, Ross J. Kang
Improper coloring of unit disk graphs. Networks 54(3): 150-164 (2009) - 2008
- [j25]Frédéric Havet, Min-Li Yu:
(p, 1)-Total labelling of graphs. Discret. Math. 308(4): 496-513 (2008) - [j24]Frédéric Havet, Stéphan Thomassé
Hoàng-Reed conjecture holds for tournaments. Discret. Math. 308(15): 3412-3415 (2008) - [j23]Louigi Addario-Berry, Maria Chudnovsky
Bisimplicial vertices in even-hole-free graphs. J. Comb. Theory B 98(6): 1119-1164 (2008) - [j22]Frédéric Havet, Jean-Sébastien Sereni, Riste Skrekovski
3-Facial Coloring of Plane Graphs. SIAM J. Discret. Math. 22(1): 231-247 (2008) - [c4]Frédéric Havet, Bruce A. Reed, Jean-Sébastien Sereni:
L(2, 1)-labelling of graphs. SODA 2008: 621-630 - 2007
- [j21]Frédéric Havet, Jan van den Heuvel
List Colouring Squares of Planar Graphs. Electron. Notes Discret. Math. 29: 515-519 (2007) - [j20]Louigi Addario-Berry, Frédéric Havet, Stéphan Thomassé
Paths with two blocks in n-chromatic digraphs. J. Comb. Theory B 97(4): 620-626 (2007) - [i2]Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé:
WDM and Directed Star Arboricity. CoRR abs/0705.0315 (2007) - 2006
- [j19]Frédéric Havet, Jean-Sébastien Sereni:
Improper choosability of graphs and maximum average degree. J. Graph Theory 52(3): 181-199 (2006) - [j18]Stéphane Bessy, Frédéric Havet, Etienne Birmelé:
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree. J. Graph Theory 53(4): 315-332 (2006) - [j17]Frédéric Havet:
Repartitors, Selectors and Superselectors. J. Interconnect. Networks 7(3): 391-415 (2006) - [j16]Jean-Claude Bermond, Frédéric Havet, Csaba D. Tóth:
Fault tolerant on-board networks with priorities. Networks 47(1): 9-25 (2006) - [i1]Frédéric Havet, Jean-Sébastien Sereni, Riste Skrekovski:
3-facial colouring of plane graphs. CoRR abs/cs/0607008 (2006) - 2005
- [j15]Frédéric Havet, Ross J. Kang, Jean-Sébastien Sereni:
Improper Colourings of Unit Disk Graphs. Electron. Notes Discret. Math. 22: 123-128 (2005) - [c3]Frédéric Havet, Jean-Sébastien Sereni:
Channel Assignment and Improper Choosability of Graphs. WG 2005: 81-90 - 2004
- [j14]Stéphan Ceroi, Frédéric Havet:
Trees with three leaves are (n+1)-unavoidable. Discret. Appl. Math. 141(1-3): 19-39 (2004) - [j13]Frédéric Havet:
Stable set meeting every longest path. Discret. Math. 289(1-3): 169-173 (2004) - [j12]Frédéric Havet:
Pancyclic arcs and connectivity in tournaments. J. Graph Theory 47(2): 87-110 (2004) - [j11]Frédéric Havet, Marc Wennink:
The Push Tree problem. Networks 44(4): 281-291 (2004) - 2003
- [j10]Frédéric Havet:
On Unavoidability of Trees with kLeaves. Graphs Comb. 19(1): 101-110 (2003) - 2002
- [j9]Frédéric Havet:
Trees in tournaments. Discret. Math. 243(1-3): 121-134 (2002) - [j8]Frédéric Havet, Janez Zerovnik
Finding a five bicolouring of a triangle-free subgraph of the triangular lattice. Discret. Math. 244(1-3): 103-108 (2002) - [c2]Frédéric Havet:
Design of Fault Tolerant Satellite Networks with Priorities via Selectors. SIROCCO 2002: 165-179 - 2001
- [j7]Frédéric Havet:
Channel assignment and multicolouring of the induced subgraphs of the triangular lattice. Discret. Math. 233(1-3): 219-231 (2001) - [j6]Stéphan Ceroi, Frédéric Havet:
Trees with three leaves are (n + l)-unavoidable. Electron. Notes Discret. Math. 7: 202-205 (2001) - [c1]Frédéric Havet, Marc Wennink:
The push tree problem. SPAA 2001: 318-319 - 2000
- [j5]Frédéric Havet:
Trees in tournaments. Electron. Notes Discret. Math. 5: 166-169 (2000) - [j4]Frédéric Havet:
Finding an Oriented Hamiltonian Path in a Tournament. J. Algorithms 36(2): 253-275 (2000) - [j3]Frédéric Havet, Stéphan Thomassé:
Oriented Hamiltonian Paths in Tournaments: A Proof of Rosenfeld's Conjecture. J. Comb. Theory B 78(2): 243-273 (2000) - [j2]Frédéric Havet:
Oriented Hamiltonian Cycles in Tournaments. J. Comb. Theory B 80(1): 1-31 (2000) - [j1]Frédéric Havet, Stéphan Thomassé:
Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture. J. Graph Theory 35(4): 244-256 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-19 00:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: