A linear time algorithm for \(7\)-\([3]\)coloring triangle-free hexagonal graphs (Q436606): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 01:15, 5 March 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