Approximate constrained bipartite edge coloring
Discrete Applied Mathematics
On the computational complexity of partial covers of Theta graphs
Discrete Applied Mathematics
Testing planarity of partially embedded graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Complexity of locally injective homomorphism to the theta graphs
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Extending partial representations of interval graphs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Locally injective homomorphism to the simple weight graphs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Locally injective graph homomorphism: lists guarantee dichotomy
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
The hardness of train rearrangements
Operations Research Letters
Extending partial representations of function graphs and permutation graphs
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.00 |
We show that the following problem is NP complete: LetG be a cubic bipartite graph and f be a precoloringof a subset of edges of G using at most three colors. Canf be extended to a proper edge 3-coloring of the entiregraph G? This result provides a natural counterpart toclassical Holyer's result on edge 3-colorability of cubic graphsand a strengthening of results on precoloring extension of perfectgraphs. © 2003 Wiley Periodicals, Inc. J Graph Theory 43:156160, 2003Supported by the Ministry of Education of the Czech Republic asProject LN00A056.