𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a probability problem concerning telephone traffic

✍ Scribed by L. Takács


Publisher
Akadmiai Kiad
Year
1957
Tongue
English
Weight
300 KB
Volume
8
Category
Article
ISSN
1588-2632

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


On a problem concerning ordered colourin
✍ Louis Caccetta; Rui Zhong Jia 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 192 KB

Let G be a connected graph with v(G)>~2 vertices and independence number ~(G). G is critical if for any edge e of G: (i) ~(G -e) > ct(G), if e is not a cut edge of G, and , 2, ife is a cut edge and Gi, G2 are the two components of G-e.