𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture

✍ Scribed by Ken-ichi Kawarabayashi; Michael D. Plummer; Bjarne Toft

Book ID
108167384
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
219 KB
Volume
95
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On Meyniel's conjecture of the cop numbe
On Meyniel's conjecture of the cop number
✍ Linyuan Lu; Xing Peng πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 152 KB

## Abstract Meyniel conjectured that the cop number __c__(__G__) of any connected graph __G__ on __n__ vertices is at most for some constant __C__. In this article, we prove Meyniel's conjecture in special cases that __G__ has diameter 2 or __G__ is a bipartite graph of diameter 3. For general con

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.

A theorem about a conjecture of H. Meyni
A theorem about a conjecture of H. Meyniel on kernel-perfect graphs
✍ Hortensia Galeana-SΓ‘nchez πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 391 KB

A digraph D is said to be an R-digraph (kernel-perfect graph) if all of its induced subdigraphs possesses a kernel (independent dominating subset). I show in this work that a digraph D, without directed triangles all of whose odd directed cycles C = (1, 2,..., 2n + 1, 1), possesses two short chords

On the orientation of meyniel graphs
On the orientation of meyniel graphs
✍ Mostaffa Blidia; Pierre Duchet; FrΓ©dΓ©ric Maffray πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 360 KB

## Abstract A kernel of a directed graph is a set of vertices __K__ that is both absorbant and independent (i.e., every vertex not in __K__ is the origin of an arc whose extremity is in __K__, and no arc of the graph has both endpoints in __K__). In 1983, Meyniel conjectured that any perfect graph,