✦ LIBER ✦

The polytope of dual degree partitions

✍ Scribed by Amitava Bhattacharya; Shmuel Friedland; Uri N. Peled

Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 132 KB
Volume: 426
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2007.05.022

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A polynomial dual of partitions

✍ Jacob T.B Beard Jr; Ann D Dorris 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 402 KB

Judicious partitions of bounded-degree g

Judicious partitions of bounded-degree graphs

✍ B. Bollobás; A. D. Scott 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 1 views

## Abstract We prove results on partitioning graphs __G__ with bounded maximum degree. In particular, we provide optimal bounds for bipartitions __V__(__G__) = __V__~1~ ∪ __V__~2~ in which we minimize {__e__(__V__~1~), __e__(__V__~2~)}. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 131–143, 200

Regular partitions of dual polar spaces

✍ Ilaria Cardinali; Bart De Bruyn 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 396 KB

Partitions with no Coarsenings of Higher

Partitions with no Coarsenings of Higher Degree

✍ Stephen H. Brackin 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 252 KB

l ) This material was part of the author's doctoral dissertation at the Pennsylvania State University [I]. He wishes to thank his dissertation advisor, STEPHEN G. SIMPSON.

The polytope of block diagonal matrices

The polytope of block diagonal matrices and complete bipartite partitionings

✍ Crama, Yves; Oosten, Maarten 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 259 KB 👁 1 views

Motivated by a fundamental clustering problem arising in several areas (production management, marketing, numerical analysis, etc.), we investigate the facial structure of the polytope whose extreme points are all 0-1 block diagonal matrices. For this polytope, general properties of facet-defining i

Cyclic degree and cyclic coloring of 3-p

Cyclic degree and cyclic coloring of 3-polytopes

✍ Borodin, Oleg V. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 402 KB 👁 1 views

A vertex coloring of a plane graph is called cyclic if the vertices in each face bounding cycle are colored differently. The main result is an improvement of the upper bound for the cyclic chromatic number of 3-polytopes due to Plummer and Toft, 1987 (J. Graph Theory 11 (1 987) 505-51 7). The proof