Some new bounds on partition critical hypergraphs
From MaRDI portal
Publication:412276
DOI10.1016/j.ejc.2011.09.023zbMath1239.05131MaRDI QIDQ412276
Publication date: 4 May 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2011.09.023
Related Items
Cites Work
- On 3-chromatic hypergraphs
- Forestation in hypergraphs: Linear \(k\)-trees
- A survey of forbidden configuration results
- The existence problem for colour critical linear hypergraphs
- Improved bounds and algorithms for hypergraph 2-coloring
- Color critical hypergraphs with many edges
- Some Theorems on Abstract Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item