𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Monochromatic Vs multicolored paths

✍ Scribed by Hanno Lefmann; Vojtěch Rödl; Robin Thomas

Publisher
Springer Japan
Year
1992
Tongue
English
Weight
546 KB
Volume
8
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Highly connected monochromatic subgraphs
Highly connected monochromatic subgraphs of multicolored graphs
✍ Henry Liu; Robert Morris; Noah Prince 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 786 KB

## Abstract We consider the following question of Bollobás: given an __r__‐coloring of __E__(__K~n~__), how large a __k__‐connected subgraph can we find using at most __s__ colors? We provide a partial solution to this problem when __s__=1 (and __n__ is not too small), showing that when __r__=2 the

Routing and path multicoloring
Routing and path multicoloring
✍ Christos Nomikos; Aris Pagourtzis; Stathis Zachos 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 92 KB

In optical networks it is important to make an optimal use of the available bandwidth. Given a set of requests the goal is to satisfy them by using a minimum number of wavelengths. We introduce a variation to this well known problem, by allowing multiple parallel links, in order to be able to satisf

Vertex coverings by monochromatic paths
Vertex coverings by monochromatic paths and cycles
✍ A. Gyárfás 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 254 KB

We survey some results on covering the vertices of 2-colored complete graphs by t w o paths or by t w o cycles Qf different color. W e show the role of these results i n determining path Ramsey numbers and in algorithms for finding long monochromatic paths or cycles in 2-colored complete graphs. ##