𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hajós' conjecture for line graphs

✍ Scribed by Carsten Thomassen

Book ID
108167408
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
77 KB
Volume
97
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hajós' conjecture and small cycle double
Hajós' conjecture and small cycle double covers of planar graphs
✍ Karen Seyffarth 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 865 KB

## Seyffarth, K., Hajos' conjecture and small cycle double covers of planar graphs, Discrete Mathematics 101 (1992) 291-306. We prove that every simple even planar graph on n vertices has a partition of its edge set into at most [(n -1)/2] cycles. A previous proof of this result was given by Tao,

Triangulations and the Hajós conjecture
Triangulations and the Hajós conjecture
✍ Vojtěch Rödl; Jan Zich 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 325 KB

## Abstract In his recent work Thomassen [J Combin Theory Ser B 93 (2005), 95–105] discussed various refinements of Hajós conjecture. Shortly after Mohar [Electr J Combin 12 (2005), N15] provided an answer to Thomassen's Conjecture 6.5, and proposed a possible extension. The aim of this article is

On the conjecture of hajós
On the conjecture of hajós
✍ Paul Erdős; Siemion Fajtlowicz 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 137 KB
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