✦ LIBER ✦

A new conjecture about minimal imperfect graphs

✍ Scribed by H Meyniel; S Olariu

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 208 KB
Volume: 47
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(89)90024-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

About Skew Partitions in Minimal Imperfe

About Skew Partitions in Minimal Imperfect Graphs

✍ F. Roussel; P. Rubio 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 188 KB

V. Chva tal conjectured in 1985 that a minimal imperfect graph G cannot have a skew cutset (i.e., a cutset S decomposable into disjoint sets A and B joined by all possible edges). We prove here the conjecture in the particular case where at least one of A and B is a stable set. 2001 Elsevier Science

A classification of certain graphs with

A classification of certain graphs with minimal imperfection properties

✍ S.H. Whitesides 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 941 KB

IfI,: family of Bar, w) graphs ate of interest for several reasons. For example, any minimal fomenter-example to Rerge's Strong Perfect Graph Conjecture t %ngs to this family. This paper aciounts for ail (4.3) graphs. One of these is not obtainatde by existing techniques for geg~~rati~g (a + I, w) g

A remark on Mulder's conjecture about in

A remark on Mulder's conjecture about interval-regular graphs

✍ K. Nomura 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 184 KB

Let F be a connected graph. F is said to be interval-regular if I F~\_ l(u) uF(x )J =. i holds for all vertices u and x ~ Fi(u), i > 0. For u, v e F, let I (u, v) denote the set of all vertices on a shortest path connecting u, v. A subset W of V(F) is said to be convex if l(u,v) c W holds for each u

On a Conjecture about Trees in Graphs wi

On a Conjecture about Trees in Graphs with Large Girth

✍ Tao Jiang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 169 KB

The girth of a graph G is the length of a shortest cycle in G. Dobson (1994, Ph.D. dissertation, Louisiana State University, Baton Rouge, LA) conjectured that every graph G with girth at least 2t+1 and minimum degree at least kÂt contains every tree T with k edges whose maximum degree does not excee

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

Disproof of a conjecture about independe

Disproof of a conjecture about independent branchings in k-connected directed graphs

✍ Andreas Huck 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 248 KB 👁 1 views

## Abstract For each __k__ ≥ 3, we construct a finite directed strongly __k__‐connected graph __D__ containing a vertex __t__ with the following property: For any __k__ spanning __t__‐branchings, __B__~1~, …, __B__~__k__~ in __D__ (i. e., each __B__~__i__~ is a spanning tree in __D__ directed towar