๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the Hadwiger's conjecture for graph products

โœ Scribed by L. Sunil Chandran; Naveen Sivadasan

Book ID
108113698
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
167 KB
Volume
307
Category
Article
ISSN
0012-365X

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