Properly 2-Colouring Linear Hypergraphs

DOI10.1007/978-3-540-74208-1_29zbMath1171.05373OpenAlexW1595643442MaRDI QIDQ3603480

Arkadev Chattopadhyay, Bruce A. Reed

Publication date: 17 February 2009

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74208-1_29

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees ⋮ The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size ⋮ Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs

This page was built for publication: Properly 2-Colouring Linear Hypergraphs