Extension problems with degree bounds

Authors:
Tomas Feder;Pavol Hell;Jing Huang
Affiliations:
-;School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada, V5A 1S6;Department of Mathematics and Statistics, University of Victoria, P.O. Box 3060 STN CSC, Victoria, B.C., Canada, V8P 5C2
Venue:
Discrete Applied Mathematics
Year:
2009

Citing 11
Cited 1

On the complexity of H-coloring

Journal of Combinatorial Theory Series B
Algorithmic complexity of list colorings

Discrete Applied Mathematics
Coloring precolored perfect graphs

Journal of Graph Theory
List homomorphisms to reflexive graphs

Journal of Combinatorial Theory Series B
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

SIAM Journal on Computing
Extending graph colorings

Journal of Combinatorial Theory Series B
The complexity of H-colouring of bounded degree graphs

Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Algorithms for Vertex Partitioning Problems on Partial k-Trees

SIAM Journal on Discrete Mathematics
Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms

SIAM Journal on Discrete Mathematics
Bi-arc graphs and the complexity of list homomorphisms

Journal of Graph Theory

Graph partitions with prescribed patterns

European Journal of Combinatorics

Quantified Score

Hi-index	0.04

Visualization

Abstract

We have proved in an earlier paper that the complexity of the list homomorphism problem, to a fixed graph H, does not change when the input graphs are restricted to have bounded degrees (except in the trivial case when the bound is two). By way of contrast, we show in this paper that the extension problem, again to a fixed graph H, can, in some cases, become easier for graphs with bounded degrees.