✦ LIBER ✦

A Generalization of the Gallai–Roy Theorem

✍ Scribed by Hao Li

Publisher: Springer Japan
Year: 2001
Tongue: English
Weight: 79 KB
Volume: 17
Category: Article
ISSN: 0911-0119
DOI: 10.1007/pl00007256

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a generalization of the Gallai–Roy–Vi

On a generalization of the Gallai–Roy–Vitaver theorem to the bandwidth coloring problem

✍ Bernard Gendron; Alain Hertz; Patrick St-Louis 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 239 KB

Variations on the Roy-Gallai theorem

✍ Dominique de Werra; Pierre Hansen 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 77 KB

On a generalization of the Gallai-Sylves

On a generalization of the Gallai-Sylvester theorem

✍ Yaakov S. Kupitz 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 934 KB

A matroid generalization of theorems of

A matroid generalization of theorems of Lewin and Gallai

✍ Yoji Kajitani; Shuichi Ueno 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 198 KB

A generalization of the representation t

A generalization of the representation theorem

✍ Dan A. Ralescu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 202 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