Two-anticoloring of planar and related graphs (Q5485315)
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: Two-anticoloring of planar and related graphs |
scientific article; zbMATH DE number 5050581
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-anticoloring of planar and related graphs |
scientific article; zbMATH DE number 5050581 |
Statements
29 August 2006
0 references
algorithm
0 references
combinatorial optimization
0 references
graph anticoloring
0 references
separation
0 references
0.9292265176773072
0 references
0.8769317269325256
0 references
0.8507941365242004
0 references
0.8158128261566162
0 references
0.7699838876724243
0 references
