scientific article; zbMATH DE number 5963814

MaRDI QIDQ3094558zbMATH OpenFDO

Authors G. C. Lau, Y. H. Peng

Publication date 25 October 2011

zbMATH Keywords

chromatic polynomialchromatic uniquenessTurán graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 6007676
• Chromaticity of Turán graphs with at most three edges deleted
• Chromaticity of complete 4-partite graphs with certain star or matching deleted
• Chromaticity of complete 5-partite graphs with certain star or matching deleted
• Some theorems concerning the star chromatic number of a graph
• Chromaticity of complete 6-partite graphs with certain star or matching deleted. II
• scientific article; zbMATH DE number 1347013
• Chromaticity of complete 6-partite graphs with certain star or matching deleted
• The star chromatic numbers of some graphs.
• Turán graphs and the number of colorings

Cited in

(2)

• scientific article; zbMATH DE number 6007676 (Why is no real title available?)
• Chromaticity of Turán graphs with at most three edges deleted

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