𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The minimization of graph schemes

✍ Scribed by V.A. Tuzov

Publisher
Elsevier Science
Year
1968
Weight
535 KB
Volume
8
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The connectivity of minimal imperfect gr
The connectivity of minimal imperfect graphs
✍ SebοΏ½, AndrοΏ½s πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 535 KB

We prove that partitionable graphs are 2w -2-connected, that this bound is sharp, and prove some structural properties of cutsets of cardinality 2w -2. The proof of the connectivity result is a simple linear algebraic proof.

The minimum degree of Ramsey-minimal gra
The minimum degree of Ramsey-minimal graphs
✍ Jacob Fox; Kathy Lin πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 144 KB πŸ‘ 1 views

## Abstract We write __H__ → __G__ if every 2‐coloring of the edges of graph __H__ contains a monochromatic copy of graph __G__. A graph __H__ is __G__‐__minimal__ if __H__ → __G__, but for every proper subgraph __H__β€² of __H__, __H__′ ↛ __G__. We define __s__(__G__) to be the minimum __s__ such th

On some minimal graphs of the torus
On some minimal graphs of the torus
✍ R. Bodendiek; K. Wagner πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 259 KB πŸ‘ 1 views

## Let be the set of finite, simple and nondirected graphs being not embeddable into the torus. Furthermore let >4 be a partial order-relation and M, (r) the minimal basis of I'. In this paper we determine three graphs of M, (r) being embeddable into the projective plane and containing the subgrap

On the minimum degree of minimal Ramsey
On the minimum degree of minimal Ramsey graphs
✍ Tibor SzabΓ³; Philipp Zumstein; Stefanie ZΓΌrcher πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 145 KB πŸ‘ 1 views

## Abstract We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by Burr et al. We determine the corresponding graph parameter for numerous bipartite graphs, including bi‐regular bipartite graphs and forests. We also make initial progress for graphs of l