𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Note on Large Rainbow Matchings in Edge-coloured Graphs

✍ Scribed by Allan Lo, Ta Sheng Tan

Book ID
120788810
Publisher
Springer Japan
Year
2012
Tongue
English
Weight
138 KB
Volume
30
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

A list version of Dirac's theorem on the
A list version of Dirac's theorem on the number of edges in colour-critical graphs
✍ Alexandr V. Kostochka; Michael Stiebitz πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 110 KB πŸ‘ 2 views

## Abstract One of the basic results in graph colouring is Brooks' theorem [R. L. Brooks, Proc Cambridge Phil Soc 37 (1941) 194–197], which asserts that the chromatic number of every connected graph, that is not a complete graph or an odd cycle, does not exceed its maximum degree. As an extension o