𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Construction of a family of graphs with a small induced proper subgraph with minimum degree 3

✍ Scribed by Sul-young Choi; Puhua Guan


Book ID
108113632
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
123 KB
Volume
307
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Graphs with a small number of distinct i
✍ Noga Alon; BΓ©la BollobΓ‘s πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 514 KB

Let G be a graph on n vertices. We show that if the total number of isomorphism types of induced subgraphs of G is at most &II', where E < lo-\*', then either G or its complement contain an independent set on at least (1 -4e)n vertices. This settles a problem of Erdiis and Hajnal.

Domination number in graphs with minimum
✍ Er Fang Shan; Moo Young Sohn; Xu Dong Yuan; Michael A. Henning πŸ“‚ Article πŸ“… 2009 πŸ› Institute of Mathematics, Chinese Academy of Scien 🌐 English βš– 264 KB