✦ LIBER ✦

On monochromatic paths in edge-coloured digraphs

✍ Scribed by B Sands; N Sauer; R Woodrow

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 292 KB
Volume: 33
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(82)90047-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On monochromatic paths and monochromatic

On monochromatic paths and monochromatic cycles in edge coloured tournaments

✍ H. Galeana-Sánchez 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 472 KB

On monochromatic paths in m-coloured tou

On monochromatic paths in m-coloured tournaments

✍ Shen Minggang 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 194 KB

Monochromatic paths in edge-colored grap

Monochromatic paths in edge-colored graphs

✍ V Chvátal 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 64 KB

Monochromatic paths and circuits in edge

Monochromatic paths and circuits in edge-colored graphs

✍ D.T Busolini 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 75 KB

On cycles and paths in digraphs

✍ M.C. Heydemann 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 273 KB

The purpose of this communication is to announce some slrfficient conditions on degrees and number of arcs to insure the existence of cycles and paths in directed graphs. We show that these results are the best possible. The proofs of the theorems can be found in [4].

A Note on Alternating Cycles in Edge-Col

A Note on Alternating Cycles in Edge-Coloured Graphs

✍ Anders Yeo 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 431 KB

Grossman and Ha ggkvist gave a sufficient condition under which a two-edgecoloured graph must have an alternating cycle (i.e., a cycle in which no two consecutive edges have the same colour). We extend their result to edge-coloured graphs with any number of colours. That is, we show that if there is