𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximal Trees with Bounded Maximum Degree in a Graph

✍ Scribed by Noga Alon; Mario Szegedy

Publisher
Springer Japan
Year
1998
Tongue
English
Weight
123 KB
Volume
14
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Decompositions of graphs into forests wi
Decompositions of graphs into forests with bounded maximum degree
✍ MirosΕ‚aw TruszczyΕ„ski πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 995 KB

Truszczydski, M., Decompositions of graphs into forests with bounded maximum degree, Discrete Mathematics 98 (1991) 207-222.

On Induced Ramsey Numbers for Graphs wit
On Induced Ramsey Numbers for Graphs with Bounded Maximum Degree
✍ Tomasz Łuczak; VojtΔ›ch RΓΆdl πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 435 KB

For graphs G and H we write G wΓ„ ind H if every 2-edge colouring of G yields an induced monochromatic copy of H. The induced Ramsey number for H is defined as r ind (H)=min[ |V(G)|: G wΓ„ ind H]. We show that for every d 1 there exists an absolute constant c d such that r ind (H n, d ) n cd for every

Maximizing the number of independent sub
Maximizing the number of independent subsets over trees with bounded degree
✍ Clemens Heuberger; Stephan G Wagner πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 208 KB πŸ‘ 1 views

## Abstract The number of independent vertex subsets is a graph parameter that is, apart from its purely mathematical importance, of interest in mathematical chemistry. In particular, the problem of maximizing or minimizing the number of independent vertex subsets within a given class of graphs has