Journal Articles
Theoretical Computer Science
Year : 2019
Jérémie Schutz : Connect in order to contact the contributor
https://hal.univ-lorraine.fr/hal-03242335
Submitted on : Monday, May 31, 2021-8:15:44 AM
Last modification on : Wednesday, October 30, 2024-6:18:29 PM
Cite
Petr Golovach, Dieter Kratsch, Mohamed Yosri Sayadi. Enumeration of maximal irredundant sets for claw-free graphs. Theoretical Computer Science, 2019, 754, pp.3-15. ⟨10.1016/j.tcs.2018.02.014⟩. ⟨hal-03242335⟩
Collections
16
View
0
Download