On 2-coloring certain \(k\)-uniform hypergraphs

DOI10.1016/S0097-3165(02)00024-9zbMath1010.05027MaRDI QIDQ1865419

Sundar Vishwanathan

Publication date: 26 March 2003

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

zbMATH Keywords

hypergraphcolouringpermanentquasi-matching

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Polychromatic colorings of hypergraphs with high balance ⋮ Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs ⋮ Concepts on coloring of cluster hypergraphs with application ⋮ Color-blind index in graphs of very low degree ⋮ Polychromatic colorings and cover decompositions of hypergraphs ⋮ Majority colorings of sparse digraphs ⋮ 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs

Cites Work

• Unnamed Item
• Regular subgraphs of almost regular graphs
• Colorings and orientations of graphs
• Every 8-uniform 8-regular hypergraph is 2-colorable
• The Even Cycle Problem for Directed Graphs
• ON THE TWO-COLOURING OF HYPERGRAPHS
• Combinatorial Nullstellensatz
• Improved bounds and algorithms for hypergraph 2-coloring

This page was built for publication: On 2-coloring certain \(k\)-uniform hypergraphs