受强制性开放获取政策约束的文章 - Hervé Hocquard了解详情
可在其他位置公开访问的文章：8 篇
Complexity and algorithms for injective edge-coloring in graphs
F Foucaud, H Hocquard, D Lajou
Information Processing Letters 170, 106121, 2021
强制性开放获取政策： Agence Nationale de la Recherche
Between proper and strong edge‐colorings of subcubic graphs
H Hocquard, D Lajou, B Lužar
Journal of Graph Theory 101 (4), 686-716, 2022
强制性开放获取政策： Slovenian Research Agency
Exact square coloring of subcubic planar graphs
F Foucaud, H Hocquard, S Mishra, N Narayanan, R Naserasr, E Sopena, ...
Discrete Applied Mathematics 293, 74-89, 2021
强制性开放获取政策： Department of Science & Technology, India, Agence Nationale de la Recherche
A connected version of the graph coloring game
C Charpentier, H Hocquard, É Sopena, X Zhu
Discrete Applied Mathematics 283, 744-750, 2020
强制性开放获取政策： 国家自然科学基金委员会, Agence Nationale de la Recherche
Parameterized complexity of edge-coloured and signed graph homomorphism problems
F Foucaud, H Hocquard, D Lajou, V Mitsou, T Pierron
14th International Symposium on Parameterized and Exact Computation (IPEC 2019), 2019
强制性开放获取政策： Agence Nationale de la Recherche
Going wide with the 1-2-3 Conjecture
J Bensmail, H Hocquard, PM Marcille
Discrete Applied Mathematics 320, 15-32, 2022
强制性开放获取政策： Agence Nationale de la Recherche
Graph modification for edge-coloured and signed graph homomorphism problems: Parameterized and classical complexity
F Foucaud, H Hocquard, D Lajou, V Mitsou, T Pierron
Algorithmica 84 (5), 1183-1212, 2022
强制性开放获取政策： Agence Nationale de la Recherche
Robustness of distances and diameter in a fragile network
A Casteigts, T Corsini, H Hocquard, A Labourel
1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), 2022
强制性开放获取政策： Agence Nationale de la Recherche
出版信息和资助信息由计算机程序自动确定