Square critically 3-chromatic hypergraphs (Q1292808)
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: Square critically 3-chromatic hypergraphs |
scientific article; zbMATH DE number 1321996
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Square critically 3-chromatic hypergraphs |
scientific article; zbMATH DE number 1321996 |
Statements
Square critically 3-chromatic hypergraphs (English)
0 references
10 April 2000
0 references
A hypergraph is square if it has the same number of vertices and edges, and 3-chromatic if it has chromatic number 3, but every proper subgraph has a 2-coloring. The paper studies various properties of square 3-chromatic hypergraphs.
0 references
hypergraph
0 references
chromatic number
0 references
