A NEW PROOF OF THE H-COLORING DICHOTOMY

In this paper, we present a new proof of the $H$-coloring dichotomy, which was first proved by Hell and Nesetril in 1990, and then was reproved by Bulatov in 2005. Our proof is much shorter than the original proof and avoids the algebraic machinery of Bulatov's proof.

Saved in:
Bibliographic Details
Published inSIAM journal on discrete mathematics Vol. 23; no. 4; pp. 2204 - 2210
Main Author SIGGERS, Mark H
Format Journal Article
LanguageEnglish
Published Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2010
Subjects
Algebra
Combinatorics
Combinatorics. Ordered structures
Exact sciences and technology
Graphs
Mathematical analysis
Mathematics
Ordinary differential equations
Polymorphism
Sciences and techniques of general use
Dichotomy
H-coloring
Discrete mathematics
Proof
05C15
Online AccessGet full text

Cover

More Information
Summary:In this paper, we present a new proof of the $H$-coloring dichotomy, which was first proved by Hell and Nesetril in 1990, and then was reproved by Bulatov in 2005. Our proof is much shorter than the original proof and avoids the algebraic machinery of Bulatov's proof.
ISSN:0895-4801
1095-7146
DOI:10.1137/080736697