Testing hypergraph coloring

DOI10.1007/3-540-48224-5_41MaRDI QIDQ4535042zbMATH OpenFDO

Authors Christian Sohler, Artur Czumaj

Publication date 12 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2076/20760493

Mathematics Subject Classification ID

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

Recommendations

• Testing hypergraph colorability
• Testing graphs for colorability properties*
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• scientific article; zbMATH DE number 2086691
• Testing k-colorability

Cited in

(17)

• Testing hypergraph colorability
• Random sampling and approximation of MAX-CSPs
• Testing k-colorability
• Linear equations, arithmetic progressions and hypergraph property testing
• Linear equations, arithmetic progressions and hypergraph property testing
• A proof of Green's conjecture regarding the removal properties of sets of linear equations
• A note on the testability of Ramsey's class
• Hypergraph coloring and reconfigured RAM testing
• Testing graphs for colorability properties*
• scientific article; zbMATH DE number 2086691 (Why is no real title available?)
• Testing subgraphs in large graphs
• scientific article; zbMATH DE number 2119722 (Why is no real title available?)
• Improved dynamic graph coloring
• Distributed Testing of Distance-k Colorings
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Testing subgraphs in directed graphs
• A fast coloring oracle for average case hypergraphs

This page was built for publication: Testing hypergraph coloring

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