Publications
Papers
Work in progress
Adjacent vertex-distinguishing edge coloring of graphs with M. Bonamy, N. Bousquet and D. Lajou.
Adjacent vertex-distinguishing total colouring of graphs.
Strong edge colouring of planar graphs.
Research Report
[3] Acyclic coloring of graph with maximum degree five. H. Hocquard and M. Montassier. Research Report RR-1450-08, 2008. Research report RR-1450-08. Revised version, 2010.
[2] Acyclic coloring of graphs with maximum degree bounded. Y. Dieng, H. Hocquard and R. Naserasr. LaBRI, 2010, Manuscrit.
[1] Strong edge colouring of planar graphs. H. Hocquard, P. Ochem, and P. Valicov. LaBRI, 2011, Manuscrit.
Talks
International conferences
[18] The Weak (2,2)-Labelling Problem for graphs with forbidden induced structures. J. Bensmail, H. Hocquard, P.-M. Marcille. In CALDAM 2023, Gandhinagar, India, February 9-11, 2023.
[17] Robustness of Distances and Diameter in a Fragile Network.
A. Casteigts, T. Corsini, H. Hocquard, and A. Labourel. In SAND 2022 : 1st Symposium on Algorithmic Foundations of Dynamic Networks. Online Conference : March 28-30, 2022.
[16] A proof of the Multiplicative 1-2-3 Conjecture. J. Bensmail, H. Hocquard, D. Lajou, and E. Sopena. In CALDAM 2022, the 8th Annual International Conference on Algorithms and Discrete Applied Mathematics
February 10-12, 2022, Pondicherry University, Puducherry, India.
[15] Between proper and strong edge-colorings of subcubic graphs. H. Hocquard, D. Lajou, and B. Lužar. In
IWOCA 2020 : 31st International Workshop on Combinatorial Algorithms June 8-10, 2020, Bordeaux, France.
[14] Parameterized complexity of edge-coloured and signed graph
homomorphisms. F. Foucaud, H. Hocquard, D. Lajou, V. Mitsou and T. Pierron. In IPEC 2019, 14th International Symposium on Parameterized and Exact Computation. Munich, Germany, September 11–13, 2019.
[13] A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions. O. Baudon, J. Bensmail, T. Davot, H. Hocquard, J. Przybyło, M. Senhaji, E. Sopena and M. Woźniak. In ICGT 2018, 10th International Colloquium on Graph Theory and combinatorics. Lyon, France, July 9-13, 2018.
[12] Strong edge colouring sparse graphs. J. Bensmail, M. Bonamy, and H. Hocquard. In Eurocomb 2015, European conference on Combinatorics, Graph Theory and Applications. Bergen, August 31-September 4, 2015. Submitted version.
[11] Incidence coloring of planar graphs without adjacent short cycles. H. Hocquard, S. Kerdjoudj, and A. Raspaud. VIII ALIO/EURO Workshop on Applied Combinatorial Optimization December 8-10, 2014, Montevideo, Uruguay.
[10] Incidence coloring of graphs with high maximum average degree. H. Hocquard, S. Kerdjoudj, and A. Raspaud. In BGW14, Bordeaux, November, 2014.
[9] Extremal results on the incidence coloring of sparse graphs. M. Bonamy, and H. Hocquard. In BGW14, Bordeaux, November, 2014.
[8] Strong edge-colouring of sparse planar graphs. J. Bensmail, A. Harutyunyan, H. Hocquard, and P. Valicov. In ICGT 2014, 7th International Conference on Graph Transformation. Grenoble, June 30-July 4, 2014.
[6] Adjacent vertex-distinguishing edge coloring of graphs. M. Bonamy, N. Bousquet and H. Hocquard. In BGW12, Bordeaux, November, 2012.
[5] New results for strong edge colouring of subcubic graphs. H. Hocquard, M. Montassier, A. Raspaud and P. Valicov. In BGW12, Bordeaux, November, 2012.
Conferences in French
[5] Robustesse des distances et du diamètre dans un réseau fragile.
A. Casteigts, T. Corsini, H. Hocquard, and A. Labourel. In ROADEF 2022 : 23ème édition du congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision. Lyon, February 23-25, 2022.
[4] Coloration d'arêtes sommets adjacents distinguants de graphes.
H. Hocquard and M. Montassier. In JGA 2011, Lyon, November 16-18, 2011.Talk
[3] NP-completude pour la coloration d'arêtes à distance 2.
H. Hocquard, P. Ochem and P. Valicov. In JGA 2010, Marseille, November 8-10, 2010.Talk
[2] Coloration d’arêtes à distance 2 des graphes subcubiques.
H. Hocquard and P. Valicov. In JGA 2010, Marseille, November 8-10, 2010.Talk
[1] Tout graphe planaire sans cycle de longueurs 4 à 12 est acycliquement 3-liste coloriable.
H. Hocquard and M. Montassier. In JGA 2009, Montpellier, November 4-6, 2009.Talk
Seminars
[8] Vertex-distinguishing edge-coloring.
H. Hocquard. In GT, Bordeaux, May 12, 2017.Talk
[7] Strong edge-colouring of graphs.
H. Hocquard. In GT, Dijon (Le2I), June 30, 2015.Talk
[6] Strong edge-colouring of graphs.
H. Hocquard. In GT, Kraków (University AGH), June 9, 2015.Talk
[5] AVD coloring.
M. Bonamy, N. Bousquet and H. Hocquard. In GT, Bordeaux, September 19, 2014.Talk
[4] Variantes de coloration de graphes.
H. Hocquard, M. Montassier, P. Ochem, A. Raspaud and P. Valicov. In GT, Lyon, May 10, 2012.
[3] Coloration d’arêtes à distance 2 des graphes subcubiques.
H. Hocquard, M. Montassier, P. Ochem, A. Raspaud and P. Valicov. In GT, Montpellier (LIRMM), February 4, 2012.
[2] Coloration d’arêtes à distance 2 des graphes subcubiques.
H. Hocquard, P. Ochem and P. Valicov. In GT, Bordeaux, February 4, 2011.Talk
[1] Coloration acyclique.
H. Hocquard and M. Montassier. In GT, Bordeaux, October 2, 2009.Talk