𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a conjecture of Meyniel

✍ Scribed by C.T Hoàng

Book ID
103506988
Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
545 KB
Volume
42
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 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

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,