Square critically 3-chromatic hypergraphs
type: Item
instance of: scholarly article
title: Square critically 3-chromatic hypergraphs
zbMATH Open document ID: 0934.05059
DOI: 10.1016/S0012-365X(99)90031-6
author: K. Appert
published in: Discrete Mathematics
publication date: 2000-04-10T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1321996
zbMATH Keywords: hypergraph
zbMATH Keywords: chromatic number
reviewed by: Vladimir D. Tonchev
MaRDI profile type: Publication
cites work: The existence problem for colour critical linear hypergraphs
cites work: Q4141279
cites work: Blocking set free configurations and their relations to digraphs and hypergraphs
cites work: Q4083461
cites work: ON THE TWO-COLOURING OF HYPERGRAPHS
cites work: Even cycles in directed graphs
cites work: The Even Cycle Problem for Directed Graphs
cites work: Q3922685
full work available at URL: s0012-365x(99)90031-6
OpenAlex ID: W4212922005
description: scientific article; zbMATH DE number 1321996