A linear time algorithm for \(7\)-\([3]\)coloring triangle-free hexagonal graphs (Q436606)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A linear time algorithm for 7-[3]coloring triangle-free hexagonal graphs |
scientific article; zbMATH DE number 6059710
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time algorithm for \(7\)-\([3]\)coloring triangle-free hexagonal graphs |
scientific article; zbMATH DE number 6059710 |
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
0 references
0.9140403270721436
0 references
0.8377483487129211
0 references
0.8288648128509521
0 references
0.8181195259094238
0 references
