✦ LIBER ✦

Häggkvist–Hell graphs: A class of Kneser-colorable graphs

✍ Scribed by David E. Roberson

Book ID: 113567480
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 343 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.10.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A class of planar four-colorable graphs

✍ Ezra Brown; Lee Johnson 📂 Article 📅 1972 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 164 KB

A Class of Three-Colorable Triangle-Free

A Class of Three-Colorable Triangle-Free Graphs

✍ Marko Radovanović; Kristina Vušković 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 543 KB

On a property of the class of n-colorabl

On a property of the class of n-colorable graphs

✍ D Seinsche 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 129 KB

Maximum Δ-edge-colorable subgraphs of cl

Maximum Δ-edge-colorable subgraphs of class II graphs

✍ Vahan V. Mkrtchyan; Eckhard Steffen 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 180 KB

## Abstract A graph __G__ is class II, if its chromatic index is at least Δ + 1. Let __H__ be a maximum Δ‐edge‐colorable subgraph of __G__. The paper proves best possible lower bounds for |__E__(__H__)|/|__E__(__G__)|, and structural properties of maximum Δ‐edge‐colorable subgraphs. It is shown tha

Universality of A-mote Graphs

✍ Roland Häggkvist; Pavol Hell 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 160 KB

Maximizing H-Colorings of a Regular Grap

Maximizing H-Colorings of a Regular Graph

✍ David Galvin 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 595 KB