An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree
Authors:
- 1 January 2012
- journal article
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E95-D (3) , 737-745
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Approximability of the Subset Sum Reconfiguration ProblemLecture Notes in Computer Science, 2011
- An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a TreeLecture Notes in Computer Science, 2011
- Reconfiguration of List Edge-Colorings in a GraphLecture Notes in Computer Science, 2009
- The Connectivity of Boolean Satisfiability: Computational and Structural DichotomiesSIAM Journal on Computing, 2009
- Reconfigurations in Graphs and GridsSIAM Journal on Discrete Mathematics, 2008
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computationTheoretical Computer Science, 2005
- List Edge and List Total Colourings of MultigraphsJournal of Combinatorial Theory, Series B, 1997
- Graph Coloring Problems1994