✦ LIBER ✦

On minimal graphs

✍ Scribed by W.D. Fellner

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 750 KB
Volume: 17
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(82)90135-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimal graphs

✍ James Eells 📂 Article 📅 1979 🏛 Springer 🌐 English ⚖ 207 KB

On minimal neighbourhood-connected graph

On minimal neighbourhood-connected graphs

✍ Bert L. Hartnell; William Kocay 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 809 KB

Hartnell, B.L. and W. Kocay, On minimal neighbourhood-connected graphs, Discrete Mathematics 92 (1991) 95-105. The closed neighbourhood of a vertex u of a graph G is u\* = {v 1 v is adjacent to u} U {u}. G is neighbourhood-connected if it is connected, and G -u' is connected but not complete, for al

On minimal elementary bipartite graphs

✍ L Lovász; M.D Plummer 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 587 KB

Some remarks on E-minimal graphs

✍ H.P. Yap 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 604 KB

A note on minimal visibility graphs

✍ Xiaojun Shen; Qing Hu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 60 KB

On transversals in minimal imperfect gra

On transversals in minimal imperfect graphs

✍ Jean-Luc Fouquet; Frédéric Maire; Irena Rusu; Henri Thuillier 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 885 KB

proved that no minimal imperfect graph has a small transversal, that is, a set of vertices of cardinality at most x + M-1 which meets every c+clique and every x-stable set. In this paper we prove that a slight generalization of this notion of small transversal leads to a conjecture which is as stro