𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hadwiger's Conjecture is True for Almost Every Graph

✍ Scribed by Bollobás, B.; Catlin, P.A.; Erdös, P.

Book ID
123401836
Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
332 KB
Volume
1
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

An approximate version of Hadwiger's con
An approximate version of Hadwiger's conjecture for claw-free graphs
✍ Maria Chudnovsky; Alexandra Ovetsky Fradkin 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 189 KB

## Abstract Hadwiger's conjecture states that every graph with chromatic number χ has a clique minor of size χ. In this paper we prove a weakened version of this conjecture for the class of claw‐free graphs (graphs that do not have a vertex with three pairwise nonadjacent neighbors). Our main resul

The -conjecture for -labelings is true f
The -conjecture for -labelings is true for total graphs
✍ Ziming Duan; Pingli Lv; Lianying Miao; Zhengke Miao; Cuiqi Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 210 KB

An L(2, 1)-labeling of a graph G is defined as a function f from the vertex set V (G) into the nonnegative integers such that for any two vertices x, y, |f Griggs and Yeh conjectured that λ 2,1 (G) ≤ ∆ 2 for any simple graph with maximum degree ∆ ≥ 2. In this paper, we consider the total graph T (G