An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs (Q3960133)
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: An O(n^2 ) Algorithm for Coloring Proper Circular Arc Graphs |
scientific article; zbMATH DE number 3782399
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs |
scientific article; zbMATH DE number 3782399 |
Statements
An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs (English)
0 references
1981
0 references
