𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A quantitative program for Hadwiger’s covering conjecture

✍ Scribed by Chuanming Zong

Book ID
107348319
Publisher
SP Science China Press
Year
2010
Tongue
English
Weight
270 KB
Volume
53
Category
Article
ISSN
1674-7283

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A case of hadwiger's conjecture
A case of hadwiger's conjecture
✍ Michael O. Albertson 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 127 KB

In this paper, we are concerned with vertex colorings, i.e., assignments of integers to the vertices of a graph. We recall Hadwiger's Conjecture. Hadwiger's Conjecture. If G is a graph with chromatic number r then G is contractible to K r. Hadwiger's Conjecture is known to be true for r less than

Hadwiger's conjecture for quasi-line gra
Hadwiger's conjecture for quasi-line graphs
✍ Maria Chudnovsky; Alexandra Ovetsky Fradkin 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 177 KB

## Abstract A graph __G__ is a quasi‐line graph if for every vertex __v__ ∈ __V__(__G__), the set of neighbors of __v__ in __G__ can be expressed as the union of two cliques. The class of quasi‐line graphs is a proper superset of the class of line graphs. Hadwiger's conjecture states that if a grap