Properly 2-Colouring Linear Hypergraphs

DOI10.1007/978-3-540-74208-1_29MaRDI QIDQ3603480zbMATH OpenOpenAlexFDO

Authors Arkadev Chattopadhyay, Bruce 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

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

Recommendations

• scientific article; zbMATH DE number 2119715
• Improved bounds and algorithms for hypergraph 2-coloring
• Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma
• Publication:4952595
• Hypergraph colouring and the Lovász local lemma

Cited in

(11)

• The 2-color relative linear van der Waerden numbers
• Linearly ordered colourings of hypergraphs
• The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size
• Improved bounds and algorithms for hypergraph 2-coloring
• Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees
• Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs
• Equitable two-colorings of uniform hypergraphs
• Coloring bipartite hypergraphs
• On-line algorithms for 2-coloring hypergraphs via chip games
• 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs
• scientific article; zbMATH DE number 2119715 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603480)