𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The chromatic difference sequence of the Cartesian product of graphs

✍ Scribed by Huishan Zhou

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
953 KB
Volume
90
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Zhou, H., The chromatic difference sequence of the Cartesian product of graphs, Discrete Mathematics 90 (1991) 297-311. The chromatic difference sequence cds(G) of a graph G with chromatic number n is defined by cds(G) = (a(l), a(2), . . , a(n)) if the sum of a(l), a(2), . , a(t) is the maximum number of vertices in an induced t-colorable subgraph of G for t = 1, 2, . , n. The Cartesian product of two graphs G and H, denoted by G 0 H, has the vertex set V(G 0 H) = V(G) x V(H) and its edge set is given by (I,, y,

πŸ“œ SIMILAR VOLUMES

Circular chromatic index of Cartesian pr
Circular chromatic index of Cartesian products of graphs
✍ Douglas B. West; Xuding Zhu πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 164 KB

## Abstract The __circular chromatic index__ of a graph __G__, written $\chi\_{c}'(G)$, is the minimum __r__ permitting a function $f : E(G)\rightarrow [0,r)$ such that $1 \le | f(e)-f(e')|\le r - 1$ whenever __e__ and $e'$ are incident. Let $G = H$ β–‘ $C\_{2m +1}$, where β–‘ denotes Cartesian product

Game coloring the Cartesian product of g
Game coloring the Cartesian product of graphs
✍ Xuding Zhu πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 186 KB

## Abstract This article proves the following result: Let __G__ and __G__β€² be graphs of orders __n__ and __n__β€², respectively. Let __G__^\*^ be obtained from __G__ by adding to each vertex a set of __n__β€² degree 1 neighbors. If __G__^\*^ has game coloring number __m__ and __G__β€² has acyclic chromat

On the ultimate normalized chromatic dif
On the ultimate normalized chromatic difference sequence of a graph
✍ Huishan Zhou πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 489 KB

For graphs G and H, the Cartesian product G Γ— H is defined as follows: the vertex set is ## V(G) Γ— V(H), and two vertices (g,h) and (9',h') are adjacent in G Γ— H if either g = g' and hh' E E(H) or h = h' and g9' E E(G). Let G k denote the Cartesian product of k copies of G. The chromatic differen