List homomorphisms and circular arc graphs (Q1977431): Difference between revisions
From MaRDI portal
Removed claims |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Pavol Hell / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Péter Komjáth / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s004939970003 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2033470072 / rank | |||
Normal rank |
Latest revision as of 20:16, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | List homomorphisms and circular arc graphs |
scientific article |
Statements
List homomorphisms and circular arc graphs (English)
0 references
14 May 2000
0 references
The list homomorphism problem for a graph \(H\) has as input a graph \(G\) and lists \(L(v)\subseteq V(H)\) for the vertices \(v\in V(G)\). The output is a homomorphism \(f:G\to H\) with \(f(v)\in L(v)\) for every \(v\in V(G)\). It is shown that if \(H\) is loopless then this problem is polynomially solvable if \(\overline{H}\) is a circular arc graph of clique covering number 2, otherwise it is NP-complete. A new characterization is given for the former case.
0 references
graph homomorphisms
0 references
list chromatic number
0 references