✦ LIBER ✦

The Gold Partition Conjecture

✍ Scribed by Marcin Peczarski

Book ID: 106489588
Publisher: Springer Netherlands
Year: 2006
Tongue: English
Weight: 134 KB
Volume: 23
Category: Article
ISSN: 0167-8094
DOI: 10.1007/s11083-006-9033-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Gold Partition Conjecture for 6-Thin

The Gold Partition Conjecture for 6-Thin Posets

✍ Marcin Peczarski 📂 Article 📅 2008 🏛 Springer Netherlands 🌐 English ⚖ 556 KB

On a matrix partition conjecture

✍ Richard A Brualdi; Geňa Hahn; Peter Horak; E.S Kramer; Stephen Mellendorf; Dale 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 673 KB

On the Berge's strong path partition con

On the Berge's strong path partition conjecture

✍ S. Sridharan 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 312 KB

Sridharan, S., On the Berge's strong path partition conjecture, Discrete Mathematics 112 (1993) 289-293. It is proved that for every k-optimal path partition of a digraph in which each component contains at most one cycle, there exists a partial k-coloring which colors strongly every path of the pa

Plane partitions V: The TSSCPP conjectur

Plane partitions V: The TSSCPP conjecture

✍ George E Andrews 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 338 KB

A partition approach to Vizing's conject

A partition approach to Vizing's conjecture

✍ 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

On the strong path partition conjecture

On the strong path partition conjecture of Berge

✍ S. Sridharan 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 354 KB