✦ LIBER ✦

Partitioning a k-connected graph

✍ Scribed by Lifshits, Yu. M.

Book ID: 120137575
Publisher: Walter de Gruyter GmbH & Co. KG
Year: 2005
Tongue: English
Weight: 112 KB
Volume: 15
Category: Article
ISSN: 0924-9265
DOI: 10.1163/156939205774464918

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vertex Partitions by Connected Monochrom

Vertex Partitions by Connected Monochromatic k-Regular Graphs

✍ Gábor N. Sárközy; Stanley M. Selkow 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 135 KB

On partitioning a graph into two connect

On partitioning a graph into two connected subgraphs

✍ Daniël Paulusma; Johan M.M. van Rooij 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 317 KB

A special k-coloring for a connected k-c

A special k-coloring for a connected k-chromatic graph

✍ Guantao Chen; Richard H. Schelp; Warren E. Shreve 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 293 KB

For each positive integer k we consider the smallest positive integer f(k) (dependent only on k) such that the following holds: Each connected graph G with chromatic number x(G) --k can be properly vertex colored by k colors so that for each pair of vertices x0 and x~ in any color class there exist

Contractible edges in a k-connected grap

Contractible edges in a k-connected graph (K1 + P4)-free graph

✍ Kiyoshi Ando 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 215 KB

Graph Partitioning (Bichot/Graph Partiti

Graph Partitioning (Bichot/Graph Partitioning) || Parallelization of Graph Partitioning

✍ Bichot, Charles-Edmond; Siarry, Patrick 📂 Article 📅 2013 🏛 John Wiley & Sons, Inc. 🌐 English ⚖ 686 KB

Edge-connectivity in p-partite graphs

✍ Lutz Volkmann 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB

Let G = (V, €1 be a finite, simple p-partite graph with minimum degree 6 and edge-connectivity A. It is proved that if IVI d (2pS)/(p -1) -2 or in special cases that if IVI I ( 2 p 6 ) / ( p -1) -1, then A = S . It is further shown that this result is best possible.