Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs
From MaRDI portal
Publication:1637144
DOI10.1016/j.disc.2018.05.002zbMath1388.05185OpenAlexW2806544754MaRDI QIDQ1637144
Anders Yeo, Michael A. Henning
Publication date: 7 June 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2018.05.002
Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Transversal (matching) theory (05D15)
Cites Work
- Unnamed Item
- Total transversals and total domination in uniform hypergraphs
- Disjoint cycles in digraphs
- Transversals and domination in uniform hypergraphs
- Transversals in 4-uniform hypergraphs
- Total domination of graphs and small transversals of hypergraphs
- Colorings and orientations of graphs
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- On 2-coloring certain \(k\)-uniform hypergraphs
- A note on fractional disjoint transversals in hypergraphs
- Every 8-uniform 8-regular hypergraph is 2-colorable
- 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs
- On 2-Colorings of Hypergraphs
- The Even Cycle Problem for Directed Graphs
- ON THE TWO-COLOURING OF HYPERGRAPHS
- Improved bounds and algorithms for hypergraph 2-coloring
This page was built for publication: Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs
