scientific article; zbMATH DE number 1301963

MaRDI QIDQ4247196zbMATH OpenFDO

Authors Chi-Jen Lu

Publication date 16 June 1999

zbMATH Keywords

approximation algorithmshypergraph

Mathematics Subject Classification ID

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

Recommendations

• Deterministic Hypergraph Coloring and Its Applications
• Approximate hypergraph coloring
• scientific article; zbMATH DE number 1002208
• Approximate coloring of uniform hypergraphs

Cited in

(10)

• Testing hypergraph colorability
• Color-bounded hypergraphs. VI: Structural and functional jumps in complexity
• Correlation decay and deterministic FPTAS for counting colorings of a graph
• scientific article; zbMATH DE number 1305459 (Why is no real title available?)
• Deterministic Hypergraph Coloring and Its Applications
• Mixed hypergraphs and beyond
• A polynomial time algorithm for checking 2-chromaticity for recursively constructed k-terminal hypergraphs
• An algebraic formulation of hypergraph colorings
• Improved algorithms for colorings of simple hypergraphs and applications
• Color-bounded hypergraphs, IV: Stable colorings of hypertrees

This page was built for publication:

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