Old Web
English
Sign In
Acemap
>
Paper
>
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters.
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters.
2017
Tatsuhiko Hatanaka
Takehiro Ito
Xiao Zhou
Keywords:
Discrete mathematics
Computer science
Combinatorics
List coloring
Parameterized complexity
Control reconfiguration
Graph
Correction
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]