✦ LIBER ✦

A proof of a conjecture on multiset coloring the powers of cycles

✍ Scribed by Yun Feng; Wensong Lin

Book ID: 116577126
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 158 KB
Volume: 112
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2012.06.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Proof of a conjecture on multisets of ho

Proof of a conjecture on multisets of hook numbers

✍ Amitai Regev; Doron Zeilberger 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 128 KB

Proof of a conjecture on cycles in a bip

Proof of a conjecture on cycles in a bipartite graph

✍ Wang, Hong 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 244 KB 👁 2 views

It was conjectured in [Wang, to appear in The Australasian Journal of Combinatorics] that, for each integer k ≥ 2, there exists . This conjecture is also verified for k = 2, 3 in [Wang, to appear; Wang, manuscript]. In this article, we prove this conjecture to be true if n ≥ 3k, i.e., M (k) ≤ 3k. W

Proof of a Conjecture of Bollob?s on Nes

Proof of a Conjecture of Bollob?s on Nested Cycles

✍ Guantao Chen; Paul Erdós; William Staton 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 221 KB

For any positive integer k, a minimum degree condition is obtained which forces a graph to have k edge-disjoint cycles C 1 , C 2 , ..., C k such that V(C 1

Proof of a conjecture of Häggkvist on cy

Proof of a conjecture of Häggkvist on cycles and independent edges

✍ Kenneth A. Berman 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 196 KB

A graph G of order n is a ck-graph if for every pair of d~tinct, nonadlacenl veJtlces x and y' d(x)+d(y)>~n+k where d(v) denotes the degree of a vertex v In this paper, we prove the

Proof of a conjecture concerning the Had

Proof of a conjecture concerning the Hadamard powers of inverse M-matrices

✍ Shencan Chen 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 108 KB

On a list coloring conjecture of Reed

✍ Tom Bohman; Ron Holzman 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 54 KB

## Abstract We construct graphs with lists of available colors for each vertex, such that the size of every list exceeds the maximum vertex‐color degree, but there exists no proper coloring from the lists. This disproves a conjecture of Reed. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 106–10