A linear time algorithm for \(7\)-\([3]\)coloring triangle-free hexagonal graphs (Q436606): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:04, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear time algorithm for \(7\)-\([3]\)coloring triangle-free hexagonal graphs |
scientific article |
Statements
A linear time algorithm for \(7\)-\([3]\)coloring triangle-free hexagonal graphs (English)
0 references
25 July 2012
0 references
graph algorithm
0 references
approximation algorithm
0 references
multicoloring
0 references
frequency planning
0 references
hexagonal graph
0 references
