✦ LIBER ✦

Fractional Colouring and Hadwiger's Conjecture

✍ Scribed by Bruce Reed; Paul Seymour

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 162 KB
Volume: 74
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1998.1835

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Subcontraction-equivalence and Hadwiger'

Subcontraction-equivalence and Hadwiger's conjecture

✍ D. R. Woodall 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 350 KB

The concept of subcontraction-equivalence is defined, and 14 graphtheoretic properties are exhibited that are all subcontraction-equivalent if Hadwiger's conjecture is true. Some subsets of these properties are proved to be subcontraction-equivalent anyway. Hadwiger's conjecture is expressed as the

Tutte's Edge-Colouring Conjecture

✍ Neil Robertson; Paul Seymour; Robin Thomas 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 340 KB

## dedicated to professor w. t. tutte on the occasion of his eightieth birthday Tutte made the conjecture in 1966 that every 2-connected cubic graph not containing the Petersen graph as a minor is 3-edge-colourable. The conjecture is still open, but we show that it is true, in general, provided it

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

A short proof of a theorem of dirac's ab

A short proof of a theorem of dirac's about hadwiger's conjecture

✍ D. R. Woodall 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB 👁 1 views

## Abstract A Short proof is given of the theorem that every grph that does not have __K__~4~ as a subcontraction is properly vertex 3‐colorable.

Ankeny–Artin–Chowla Conjecture and Conti

Ankeny–Artin–Chowla Conjecture and Continued Fraction Expansion

✍ Ryūta Hashimoto 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 115 KB

For any prime p congruent to 1 modulo 4, let (t+u -p)Â2 be the fundamental unit of Q(p). Then Ankeny, Artin, and Chowla conjectured that u is not divisible by p. In this paper, we investigate a certain relation between the conjecture and the continued fraction expansion of (1+p)Â2. Consequently, we