( en | de | ru )

 

Disambiguation of "Havet, Frédéric"

Author of the publication

copydeleteadd this publication to your clipboard
Finding a five bicolouring of a triangle-free subgraph of the triangular lattice.

, and . Discret. Math., 244 (1-3): 103-108 (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Frédéric Robin

Frédéric Ruckert

Frédéric Roux

Frédéric Ziebarth

Frédéric Leroux

 

Other publications of authors with the same name

Spanning eulerian subdigraphs in semicomplete digraphs., , and . CoRR, (2019)Facial non-repetitive edge-coloring of plane graphs., , , and . J. Graph Theory, 66 (1): 38-48 (2011)On the semi-proper orientations of graphs., and . Discret. Appl. Math., (2021)Inversion number of an oriented graph and related parameters., , and . ALGOS, volume 2925 of CEUR Workshop Proceedings, page 101-121. CEUR-WS.org, (2020)On the Minimum Number of Arcs in \(k\)-Dicritical Oriented Graphs., , , and . SIAM J. Discret. Math., 38 (2): 1863-1901 (2024)New lower bounds on the cutwidth of graphs., , , and . Comput. Oper. Res., (2025)Complexity Dichotomies for the Minimum ℱ -Overlay Problem., , , , and . IWOCA, volume 10765 of Lecture Notes in Computer Science, page 116-127. Springer, (2017)On the Grundy Number of a Graph., and . IPEC, volume 6478 of Lecture Notes in Computer Science, page 170-179. Springer, (2010)On the Complexity of Compressing Two Dimensional Routing Tables with Order., , and . Algorithmica, 80 (1): 209-233 (2018)Finding a five bicolouring of a triangle-free subgraph of the triangular lattice., and . Discret. Math., 244 (1-3): 103-108 (2002)