On 2-Colorings of Hypergraphs
From MaRDI portal
Publication:2947946
DOI10.1002/jgt.21843zbMath1321.05173MaRDI QIDQ2947946
Anders Yeo, Michael A. Henning
Publication date: 29 September 2015
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21843
Related Items
Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs, Partitioning the vertices of a cubic graph into two total dominating sets
Cites Work
- Unnamed Item
- Disjoint cycles in digraphs
- Graphs and digraphs with all 2-factors isomorphic
- Total domination of graphs and small transversals of hypergraphs
- Bijections which preserve blocking sets
- Dual blocking sets in projective and affine planes
- Covering all cliques of a graph
- Constructions of large arcs and blocking sets in finite planes
- Small transversals in hypergraphs
- Every 8-uniform 8-regular hypergraph is 2-colorable
- 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs
- Corrigendum to ``Graphs and digraphs with all 2-factors isomorphic [J. Combin. Theory Ser. B 92 (2) (2004) 395-404]
- Vertex Disjoint Cycles of Different Length in Digraphs
- Proof of a Conjecture of Henning and Yeo on Vertex-Disjoint Directed Cycles
- Hypergraphs with large transversal number and with edge sizes at least 3
- The Even Cycle Problem for Directed Graphs
- ON THE TWO-COLOURING OF HYPERGRAPHS
- Note on disjoint blocking sets in Galois planes
- Blocking Sets in Finite Projective Planes