𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the number of shredders

✍ Scribed by Jord�n, Tibor

Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
183 KB
Volume
31
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

A subset S of k vertices in a k-connected graph G is a shredder, if G -S has at least three components. We show that if G has n vertices, then the number of shredders is at most n, which was conjectured by Cheriyan and Thurimella [

📜 SIMILAR VOLUMES

On the number of discernible colors
On the number of discernible colors
✍ C. S. McCamy 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 40 KB 👁 1 views

## On the Number of Discernible On the Number of Discernible Colors Colours I was surprised that, in their study of the number of dis-The authors are grateful to Cal McCamy for his timely cernible colors, Pointer and Attridge 1 missed the early response to their original article. Neither they, nor

On the chromatic number of disk graphs
On the chromatic number of disk graphs
✍ Malesi?ska, Ewa; Piskorz, Steffen; Wei�enfels, Gerhard 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB 👁 2 views

Colorings of disk graphs arise in the study of the frequency-assignment problem in broadcast networks. Motivated by the observations that the chromatic number of graphs modeling real networks hardly exceeds their clique number, we examine the related properties of the unit disk (UD) graphs and their

On the Rabin number problem
On the Rabin number problem
✍ Duh, Dyi-Rong; Chen, Gen-Huey 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 247 KB 👁 1 views

Given positive integers k and l, let R(k, l) denote the class of interconnection networks so that for any k / 1 distinct nodes x, y 1 , y 2 , . . . , y k there exist k node-disjoint paths (except at x) of length at most l from x to y 1 , y 2 , . . . , y k , respectively. The Rabin number of a networ

On the face touching number
On the face touching number
✍ Sanders, Daniel P. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 399 KB 👁 1 views

In a 3-connected plane graph, each pair of faces meet at at most either a vertex or an edge. Zha considered 3-connected graphs embedded on the projective plane, torus, and Klein bottle, showing that they meet at at most two, at most four, and a t most four vertices or edges, respectively, and demons