Web Survey on Combinatorial Reconfiguration

(back to home) (about this survey)

Filters:
Problems: Edge coloring
Choose Problem

Authors: all
Choose Author


[14]
Takehiro Ito, Marcin Kamiński and Erik D. Demaine,
Reconfiguration of list edge-colorings in a graph,
Discrete Applied Mathematics 160(15), pp. 2199-2207, 2012. (LINK)

[15]
Takehiro Ito, Kazuto Kawamura and Xiao Zhou,
An improved sufficient condition for reconfiguration of list edge-colorings in a tree,
IEICE Transactions on Information and Systems E95-D(3), pp. 737-745, 2012. (LINK)

[17]
Jessica McDonald, Bojan Mohar and Diego Scheide,
Kempe equivalence of edge-colorings in subcubic and subquartic graphs,
Journal of Graph Theory 70(2), pp. 226-239, 2012. (LINK)

[20]
Sarah-Marie Belcastro and Ruth Haas,
Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs,
Discrete Mathematics 325, pp. 77-84, 2014. (LINK)

[68]
Hiroki Osawa, Akira Suzuki, Takehiro Ito and Xiao Zhou,
The complexity of (list) edge-coloring reconfiguration problem,
Proceedings of the 11th International Workshop on Algorithms and Computation (WALCOM 2017), Lecture Notes in Computer Science 10167, pp. 347-358, 2017. (LINK)