On the complexity of \(H\)-colouring planar graphs (Q1045065): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2008.05.016 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2024156610 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3097395 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Acyclic Homomorphisms and Circular Colorings of Digraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4828516 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the complexity of H-coloring / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithmic complexity of list colorings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tree-depth, subgraph coloring and homomorphism bounds / rank | |||
Normal rank | |||
Latest revision as of 06:54, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of \(H\)-colouring planar graphs |
scientific article |
Statements
On the complexity of \(H\)-colouring planar graphs (English)
0 references
15 December 2009
0 references
graph homomorphism
0 references
\(H\)-colouring
0 references
planar graph
0 references
NP-completeness
0 references
