Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

64

RSA
2010

favoriteEmaildiscussreport

93views more RSA 2010»

Coloring H-free hypergraphs

15 years 6 days ago

Coloring H-free hypergraphs

Download www.math.cmu.edu

Tom Bohman, Alan M. Frieze, Dhruv Mubayi

Real-time Traffic

RSA 2010 |

claim paper

Related Content

» CPerfect KUniform Hypergraphs

» The Hardness of 3 Uniform Hypergraph Coloring

» Circular Chromatic Number of Hypergraphs

» Strong Colorings of Hypergraphs

» Choosability in geometric hypergraphs

» Testing Hypergraph Coloring

» An expected polynomial time algorithm for coloring 2colorable 3graphs

» Adapted List Coloring of Graphs and Hypergraphs

» On generalized Kneser hypergraph colorings

» Coloring geometric hypergraph defined by an arrangement of halfplanes

Post Info
More Details (n/a)

Added	30 Jan 2011
Updated	30 Jan 2011
Type	Journal
Year	2010
Where	RSA
Authors	Tom Bohman, Alan M. Frieze, Dhruv Mubayi

Comments (0)