Contents

-

Star Coloring of Cartesian Product of Paths and Cycles

Tianyong Han1, Zehui Shao2, Enqiang Zhu2, Zepeng Li2, Fei Deng3
1 School of Information Science and Technology Chengdu University, Chengdu 610106, China
2Peking University; Key Laboratory of High Confidence Software Technologies (Peking University), Ministry of Education, China
3School of Information Science and Technology, Chengdu University of Technology, Chengdu, 610059, China

Abstract

A star coloring of an undirected graph G is a proper vertex coloring of G such that any path on four vertices in G is not bicolored. The star chromatic number χs(G) of an undirected graph G is the smallest integer k for which G admits a star coloring with k colors. In this paper, the star chromatic numbers for some infinite subgraphs of Cartesian products of paths and cycles are established. In particular, we show that χs(Pi◻Cj)=5 for i,j4 and χs(Ci◻Cj)=5 for i,j30. We also show that χs(Pi◻Pj◻Pk)=6 for i,j,k4, χs(C3◻C3◻Ck)=7 for k3, and χs(C4i◻C4j◻P4k◻C4l)9 for i,j,k,l1. Furthermore, we give the star chromatic numbers of d-dimensional hypercubes for d6.