A generalization of the theorem of Lekkerkerker and Boland

0Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Each fixed graph H gives rise to a list H-colouring problem. The complexity of list H-colouring problems has recently been fully classified: if H is a bi-arc graph, the problem is polynomial-time solvable, and otherwise it is NP-complete. The proof of this fact relies on a forbidden substructure characterization of bi-arc graphs, reminiscent of the theorem of Lekkerkerker and Boland on interval graphs. In this note we show that in fact the theorem of Lekkerkerker and Boland can be derived from the characterization. © 2005 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Hell, P., & Huang, J. (2005). A generalization of the theorem of Lekkerkerker and Boland. Discrete Mathematics, 299(1–3), 113–119. https://doi.org/10.1016/j.disc.2004.02.022

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free