Coloring the Cartesian Sum of Graphs

DOI10.1016/j.endm.2005.06.045zbMath1200.05085OpenAlexW2115121198MaRDI QIDQ3439356

Xuding Zhu, Daphne Der-Fen Liu

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.499.8863

zbMATH Keywords

circular chromatic numberchromatic numbergraph productsCartesian sum of graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• The chromatic number of the product of two 4-chromatic graphs is 4
• On the chromatic number of the lexicographic product and the Cartesian sum of graphs
• Some star extremal circulant graphs
• Star-extremal graphs and the lexicographic product
• Coloring graph products---a survey
• Star chromatic numbers and products of graphs
• Star Extremal Circulant Graphs
• Chromatic Number of Cartesian Sum of Two Graphs
• On chromatic number of products of two graphs
• Circular chromatic number: A survey

This page was built for publication: Coloring the Cartesian Sum of Graphs