Coloring the Cartesian Sum of Graphs

DOI10.1016/J.ENDM.2005.06.045MaRDI QIDQ3439356zbMATH OpenOpenAlexFDO

Authors Daphne Der-Fen Liu, Xuding Zhu

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

Cartesian sum of graphschromatic numbercircular chromatic numbergraph products

Mathematics Subject Classification ID

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

Cites work

• Chromatic Number of Cartesian Sum of Two Graphs
• Circular chromatic number: A survey
• Coloring graph products---a survey
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• On chromatic number of products of two graphs
• On the chromatic number of the lexicographic product and the Cartesian sum of graphs
• Some star extremal circulant graphs
• Star chromatic numbers and products of graphs
• Star Extremal Circulant Graphs
• Star-extremal graphs and the lexicographic product
• The chromatic number of the product of two 4-chromatic graphs is 4

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

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