Thèse, GALaC, Mathematics, Optimisation et contrôle, Optimization and Control
Some vertex colouring problems and a generalisation of Hamilton-connectivity in graphs
Tianjiao Dai. Some vertex colouring problems and a generalisation of Hamilton-connectivity in graphs. Discrete Mathematics [cs.DM]. Université Paris-Saclay, 2023. English. ⟨NNT : 2023UPASG067⟩. ⟨tel-04259639⟩