✦ LIBER ✦

Variations on the Gallai-Milgram theorem

✍ Scribed by I.Ben-Arroyo Hartman

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 942 KB
Volume: 71
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(88)90063-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithmic note on the gallai-milgra

An algorithmic note on the gallai-milgram theorem

✍ Kathie Cameron 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 299 KB

Acyclic diagraphs with the Gallai-Milgra

Acyclic diagraphs with the Gallai-Milgram-Linial property for clique-covers

✍ Wenan Zang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 564 KB

Fractional matchings and the Edmonds-Gal

Fractional matchings and the Edmonds-Gallai theorem

✍ W.R Pulleyblank 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 542 KB

The Lax-Milgram theorem for topological

The Lax-Milgram theorem for topological vector spaces

✍ Bor-Luh Lin; Robert H Lohman 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 399 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

Wavelet variations on the Shannon sampli

Wavelet variations on the Shannon sampling theorem

✍ Hubert Bray; Kent McCormick; R.O. Wells Jr.; Xiao-dong Zhou 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 685 KB