๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Gallai-type theorems and domination parameters

โœ Scribed by Gayla S. Domke; Jean E. Dunbar; Lisa R. Markus

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
598 KB
Volume
167-168
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Gallaiโ€“Edmonds-type structure theorem
A Gallaiโ€“Edmonds-type structure theorem for path-matchings
โœ Bianca Spille; Lรกszlรณ Szegล‘ ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 122 KB

## Abstract As a generalization of matchings, Cunningham and Geelen introduced the notion of pathโ€matchings. We give a structure theorem for pathโ€matchings which generalizes the fundamental Gallaiโ€“Edmonds structure theorem for matchings. Our proof is purely combinatorial. ยฉ 2004 Wiley Periodicals,

A dominated ergodic type theorem
A dominated ergodic type theorem
โœ Henry Teicher ๐Ÿ“‚ Article ๐Ÿ“… 1967 ๐Ÿ› Springer ๐ŸŒ English โš– 187 KB
The colour theorems of Brooks and Gallai
The colour theorems of Brooks and Gallai extended
โœ A.V. Kostochka; M. Stiebitz; B. Wirth ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 283 KB

One of the basic results in graph colouring is Brooks' theorem [-4] 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 of this result, Gallai [6] characterized the subgraphs of k-colour-c