✦ LIBER ✦

Brooksʼ Theorem for generalized dart graphs

✍ Scribed by Martin Kochol; Riste Škrekovski

Book ID: 113663294
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 170 KB
Volume: 112
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2011.11.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generalized matrix tree theorem for mixe

Generalized matrix tree theorem for mixed graphs

✍ Bapat, Ravindra B.; Grossman, Jerrold W.; Kulkarni, Devadatta M. 📂 Article 📅 1999 🏛 Taylor and Francis Group 🌐 English ⚖ 709 KB

A Brooks-Type Theorem for the Generalize

A Brooks-Type Theorem for the Generalized List T-Coloring

✍ Fiala, Jirí; Král', Daniel; Skrekovski, Riste 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 319 KB

On the 1-fault hamiltonicity for graphs

On the 1-fault hamiltonicity for graphs satisfying Oreʼs theorem

✍ Hsun Su; Yuan-Kang Shih; Shin-Shin Kao 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 299 KB

An extension of Brooks' theorem to n-deg

An extension of Brooks' theorem to n-degenerate graphs

✍ John Mitchem 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 867 KB

Fw rl ~~(t,~R(QG) denotes the Lick-White vertex-partition number of C In this paper genera',xd Kcmpe paths are used to prove rhat ~"(4;) s {J(G)/(n + I)) if G is not an odd cycle, an (n h I )-regular graph. nor a complete graph on r(n + 1) + 1 vertices. This result generalizes theorems of Brooks and

A quantum analogue of Kostantʼs theorem

A quantum analogue of Kostantʼs theorem for the general linear group

✍ Avraham Aizenbud; Oded Yacobi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 179 KB

Recognizing Dart-Free Perfect Graphs

✍ Chvátal, V.; Fonlupt, J.; Sun, L.; Zemirline, A. 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 252 KB