Welsh-Powell opposition graphs (Q1115450): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(89)90107-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2012304296 / rank | |||
Normal rank | |||
Revision as of 21:16, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Welsh-Powell opposition graphs |
scientific article |
Statements
Welsh-Powell opposition graphs (English)
0 references
1989
0 references
We characterize a class of graphs for which the Welsh-Powell colouring heuristics results in an optimum colouring. We outline a polynomial-time recognition algorithm together with linear-time optimization algorithms for this class of graphs.
0 references
Welsh-Powell colouring heuristics
0 references
optimum colouring
0 references
recognition algorithm
0 references
