✦ LIBER ✦

A classification of certain graphs with minimal imperfection properties

✍ Scribed by S.H. Whitesides

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 941 KB
Volume: 38
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(82)90296-5

No coin nor oath required. For personal study only.

✦ Synopsis

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) graphs from (cu, o) graphs.

📜 SIMILAR VOLUMES

Some properties of minimal imperfect gra

Some properties of minimal imperfect graphs

✍ Chính T. Hoàng 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 539 KB

Classification of Minimal Graphs of Give

Classification of Minimal Graphs of Given Face-Width on the Torus

✍ A. Schrijver 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 666 KB

For any graph \(G\) embedded on the torus, the face-width \(r(G)\) of \(G\) is the minimum number of intersections of \(G\) and \(C\), where \(C\) ranges over all nonnullhomotopic closed curves on the torus. We call \(G r\)-minimal if \(r(G) \geqslant r\) and \(r\left(G^{\prime}\right)<r\) for each

On existence and regularity of graphs wi

On existence and regularity of graphs with certain properties

✍ Stefan Znám 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 651 KB

Minimal graphs of a torus, a projective

Minimal graphs of a torus, a projective plane and spheres and some properties of minimal graphs of homotopy classes

✍ Alexander V. Ivashchenko; Yeong-Nan Yeh 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 397 KB

## Contractible transformations of graphs consist of contractible gluing and deleting of vertices and edges of graphs. They partition all graphs into the family of homotopy classes. Contractible transformations do not change the Euler characteristic and the homology groups of graphs. In this paper

Characterization of a class of triangle-

Characterization of a class of triangle-free graphs with a certain adjacency property

✍ Brian Alspach; C. C. Chen; Katherine Heinrich 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 597 KB

## Abstract Let __m__ and __n__ be nonnegative integers. Denote by __P__(__m,n__) the set of all triangle‐free graphs __G__ such that for any independent __m__‐subset __M__ and any __n__‐subset __N__ of __V__(__G__) with __M__ ∩ __N__ = Ø, there exists a unique vertex of __G__ that is adjacent to e

The longest cycle of a graph with a larg

The longest cycle of a graph with a large minimal degree

✍ Noga Alon 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 214 KB 👁 1 views

We show that every graph G on n vertices with minimal degree at least n / k contains a cycle of length at least [ n / ( k -111. This verifies a conjecture of Katchalski. When k = 2 our result reduces t o the classical theorem of Dirac that asserts that if all degrees are at least i n then G is Hamil