Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
Discrete Applied Mathematics
Complexity results for minimum sum edge coloring
Discrete Applied Mathematics
Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth
Proceedings of the forty-second ACM symposium on Theory of computing
Extending partial representations of interval graphs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
Journal of the ACM (JACM)
Locally injective graph homomorphism: lists guarantee dichotomy
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Extending partial representations of function graphs and permutation graphs
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Effective channel assignments in cognitive radio networks
Computer Communications
| Hi-index | 0.00 |
In the edge precoloring extension problem, we are given a graph with some of the edges having preassigned colors and it has to be decided whether this coloring can be extended to a proper k-edge-coloring of the graph. In list edge coloring every edge has a list of admissible colors, and the question is whether there is a proper edge coloring where every edge receives a color from its list. We show that both problems are NP-complete on (a) planar 3-regular bipartite graphs, (b) bipartite outerplanar graphs, and (c) bipartite series-parallel graphs. This improves previous results of Easton and Parker [6], and Fiala [8]. © 2005 Wiley Periodicals, Inc. J Graph Theory 49: 313–324, 2005