✦ LIBER ✦

Minimal k-saturated and color critical graphs of prescribed minimum degree

✍ Scribed by D. A. Duffus; D. Hanson

Publisher: John Wiley and Sons
Year: 1986
Tongue: English
Weight: 505 KB
Volume: 10
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190100109

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Realizability of p-point graphs with pre

Realizability of p-point graphs with prescribed minimum degree, maximum degree, and line connectivity

✍ F. T. Boesch; C. L. Suffel 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 316 KB

## Abstract It is well known that certain graph‐theoretic extremal questions play a central role in the study of communication network vulnerability. Herein we consider a generalization of some of the classical results in this area. We define a (__p__, Δ, δ, λ) graph as a graph having __p__ points,

Infinite families of crossing-critical g

Infinite families of crossing-critical graphs with prescribed average degree and crossing number

✍ Drago Bokal 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 242 KB 👁 1 views

## Abstract Širáň constructed infinite families of __k__‐crossing‐critical graphs for every __k__⩾3 and Kochol constructed such families of simple graphs for every __k__⩾2. Richter and Thomassen argued that, for any given __k__⩾1 and __r__⩾6, there are only finitely many simple __k__‐crossing‐criti

Realizability of p-point, q-line graphs

Realizability of p-point, q-line graphs with prescribed maximum degree and line connectivity or minimum degree

✍ D. DiMarco 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 74 KB 👁 3 views

Realizability of p-point, q-line graphs

Realizability of p-point, q-line graphs with prescribed point connectivity, line connectivity, or minimum degree

✍ F. T. Boesch; C. L. Suffel 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 336 KB