A linear time algorithm for \(7\)-\([3]\)coloring triangle-free hexagonal graphs (Q436606): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B18 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6059710 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
graph algorithm | |||
Property / zbMATH Keywords: graph algorithm / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
approximation algorithm | |||
Property / zbMATH Keywords: approximation algorithm / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
multicoloring | |||
Property / zbMATH Keywords: multicoloring / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
frequency planning | |||
Property / zbMATH Keywords: frequency planning / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
hexagonal graph | |||
Property / zbMATH Keywords: hexagonal graph / rank | |||
Normal rank |
Revision as of 01:07, 30 June 2023
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