𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Increasing the minimum degree of a graph by contractions

✍ Scribed by Golovach, Petr A.; Kamiński, Marcin; Paulusma, Daniël; Thilikos, Dimitrios M.

Book ID
121923489
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
471 KB
Volume
481
Category
Article
ISSN
0304-3975

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

The number of cut-vertices in a graph of
The number of cut-vertices in a graph of given minimum degree
✍ Michael O. Albertson; David M. Berman 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Albertson, M.O. and D.M. Berman, The number of cut-vertices in a graph of given minimum degree, Discrete Mathematics 89 (1991) 97-100. A graph with n vertices and minimum degree k 2 2 can contain no more than (2k -2)n/(kz -2) cut-vertices. This bound is asymptotically tight. \* Research supported in