Between Colorings and Layouts - Minimum Morphism Cost Problems (Q3439587): 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.endm.2007.01.029 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2080294085 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the complexity of H-coloring / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: \(T\)-colorings and \(T\)-edge spans of graphs / rank | |||
Normal rank | |||
Latest revision as of 20:12, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Between Colorings and Layouts - Minimum Morphism Cost Problems |
scientific article |
Statements
Between Colorings and Layouts - Minimum Morphism Cost Problems (English)
0 references
29 May 2007
0 references
layout problems
0 references
colorings
0 references
chromatic number
0 references
minimum morphism cost
0 references
