𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the weak reconstruction of Cartesian-product graphs

✍ Scribed by Wilfried Imrich; Janez Ẑerovnik

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
590 KB
Volume
150
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

s-strongly perfect cartesian product of
s-strongly perfect cartesian product of graphs
✍ Elefterie Olaru; Eugen Mǎndrescu 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 308 KB

## Abstract The study of perfectness, via the strong perfect graph conjecture, has given rise to numerous investigations concerning the structure of many particular classes of perfect graphs. In “Perfect Product Graphs” (__Discrete Mathematics__, Vol. 20, 1977, pp. 177‐‐186), G. Ravindra and K. R.

The chromatic difference sequence of the
The chromatic difference sequence of the Cartesian product of graphs
✍ Huishan Zhou 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 953 KB

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 numb

A theorem on integer flows on cartesian
A theorem on integer flows on cartesian products of graphs
✍ Wilfried Imrich; Riste Škrekovski 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB

## Abstract It is shown that the Cartesian product of two nontrivial connected graphs admits a nowhere‐zero 4‐flow. If both factors are bipartite, then the product admits a nowhere‐zero 3‐flow. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 93–98, 2003