A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems (Q4881287)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 894061
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems |
scientific article; zbMATH DE number 894061 |
Statements
A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems (English)
0 references
25 November 1996
0 references
visibility
0 references
colouring
0 references
triangulation
0 references
polygon-guarding
0 references
0.7886014580726624
0 references
0.7815685272216797
0 references
0.7798914313316345
0 references
0.7739424109458923
0 references
