Complexity of hypergraph coloring and Seidel's switching. (Q5902530)
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: Complexity of hypergraph coloring and Seidel's switching. |
scientific article; zbMATH DE number 5655943
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of hypergraph coloring and Seidel's switching. |
scientific article; zbMATH DE number 5655943 |
Statements
Graph-Theoretic Concepts in Computer Science (English)
0 references
12 January 2010
0 references
0.880429208278656
0 references
0.8392305970191956
0 references
0.8344399333000183
0 references
