On the coloring of C-hypergraphs with minimum connected pair graphs

MaRDI QIDQ5452990zbMATHFDO

Authors Kefeng Diao, Ping Zhao

Publication date 4 April 2008

zbMATH Keywords

mixed hypergraphupper chromatic numberstrict coloringconnected pair graph

Mathematics Subject Classification ID

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

Recommendations

• A necessary and sufficient condition of \({\mathcal D}\)-complete uniform mixed hypergraphs being uncolorable
• Upper bounds on minimum number of \(\mathcal{C}\)-edges of 4-uniform \(\mathcal{C}\)-hypergraphs
• scientific article; zbMATH DE number 1439490
• About perfection of circular mixed hypergraphs
• About some classes of mixed hypergraphs uniquely colorable with two colors

Cited in

(3)

• Upper bounds on minimum number of \(\mathcal{C}\)-edges of 4-uniform \(\mathcal{C}\)-hypergraphs
• A necessary and sufficient condition of \({\mathcal D}\)-complete uniform mixed hypergraphs being uncolorable
• Maximizing H‐Colorings of Connected Graphs with Fixed Minimum Degree

This page was built for publication: On the coloring of \(C\)-hypergraphs with minimum connected pair graphs

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