scientific article; zbMATH DE number 1445283

MaRDI QIDQ4952596zbMATH OpenFDO

Authors Jan Kratochvíl, Zsolt Tuza

Publication date 16 October 2000

zbMATH Keywords

bicolorabilityclique hypergraphNP-completeperfect graphsplanar graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17) Hypergraphs (05C65)

Recommendations

• On the complexity of bicoloring clique hypergraphs of graphs
• Coloring the Maximal Cliques of Graphs
• Complexity of clique coloring and related problems
• scientific article; zbMATH DE number 3887740
• On star and biclique edge-colorings

Cited in

(5)

• Conditions for the bicolorability of primitive hypergraphs
• scientific article; zbMATH DE number 3887740 (Why is no real title available?)
• scientific article; zbMATH DE number 939919 (Why is no real title available?)
• On the complexity of bicoloring clique hypergraphs of graphs
• Biclique-colouring verification complexity and biclique-colouring power graphs

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 Q4952596)