## Abstract For a fixed integer __n__ ϵ ω, a graph __G__ of chromatic number greater than __n__ is called persistent if for all __n__ + 1‐chromatic graphs __H__, the products __G__ × __H__ are __n__ + 1‐chromatic graphs. Wheter all graphs of chromatic number greater than __n__ are persistent is a l
✦ LIBER ✦
Hypergeometric approach to Weideman’s conjecture
✍ Scribed by Wenchang Chu
- Publisher
- Springer
- Year
- 2006
- Tongue
- English
- Weight
- 82 KB
- Volume
- 87
- Category
- Article
- ISSN
- 0003-889X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
An approach to hedetniemi's conjecture
✍
N. W. Sauer; X. Zhu
📂
Article
📅
1992
🏛
John Wiley and Sons
🌐
English
⚖ 717 KB
Two approaches to Sendov's conjecture
✍
Julius Borcea
📂
Article
📅
1998
🏛
Springer
🌐
English
⚖ 184 KB
A partition approach to Vizing's conject
✍
Chen, Guantao; Piotrowski, Wiktor; Shreve, Warren
📂
Article
📅
1996
🏛
John Wiley and Sons
🌐
English
⚖ 411 KB
👁 1 views
In 1963, Vizing [Vichysl. Sistemy 9 (19631, 30-431 conjectured that y ( G X H) 2 y ( G ) y ( H ) , where G X Hdenotes the Cartesian product of graphs, and y(G) is the domination number. In this paper we define the extraction number x(G) and w e prove that ## M G ) 5 x(G) 5 y(G), and y ( G x H) 2 x
An effective approach to Keller's Jacobi
✍
Ludwik M. Drużkowski
📂
Article
📅
1983
🏛
Springer
🌐
English
⚖ 436 KB
A geometric approach to Keller's Jacobia
✍
Kamil Rusek
📂
Article
📅
1983
🏛
Springer
🌐
English
⚖ 311 KB
An intrinsic approach to Lichnerowicz co
✍
Akhil Ranjan
📂
Article
📅
2000
🏛
Indian Academy of Sciences
🌐
English
⚖ 97 KB