On the number of edges in hypergraphs critical with respect to strong colourings
From MaRDI portal
Publication:1971806
DOI10.1006/eujc.1999.0330zbMath0939.05036MaRDI QIDQ1971806
Alexandr V. Kostochka, Douglas R. Woodall
Publication date: 29 June 2000
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.1999.0330
strong colouring; bounded clique number; list strong colouring; splitting-critical \(t\)-uniform hypergraph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sparse colour-critical hypergraphs
- On the minimal number of edges in color-critical graphs
- The colour theorems of Brooks and Gallai extended
- Color-critical graphs and hypergraphs with few edges and no short cycles
- A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
- ON THE TWO-COLOURING OF HYPERGRAPHS
- Sparse color‐critical graphs and hypergraphs with no short cycles
- A generalization of Kónig's theorem