✦ LIBER ✦

Counting k-component forests of a graph

✍ Scribed by Wendy Myrvold

Publisher: John Wiley and Sons
Year: 1992
Tongue: English
Weight: 331 KB
Volume: 22
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230220704

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The k-nucleus of a graph

✍ Peter J. Slater 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 467 KB

k-Independence and thek-residue of a gra

k-Independence and thek-residue of a graph

✍ Jelen, Frank 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 282 KB 👁 2 views

Favaron, Mahéo, and Saclé proved that the residue of a simple graph G is a lower bound on its independence number α(G). For k ∈ N, a vertex set X in a graph is called k-independent, if the subgraph induced by X has maximum degree less than k. We prove that a generalization of the residue, the k-resi

On k-leaf connectivity of a random graph

✍ Thomasz Luczak 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 367 KB

We prove that, in a random graph with n vertices and N = cn log n edges, the subgraph generated by a set of all vertices of degree at least k + 1 is k-leaf connected for c > f . A threshold function for k-leaf connectivity is also found. ## 1. MAIN RESULTS Let G = (V(G),E(G)) be a graph, where V (

A gap between the appearances of a k-cor

A gap between the appearances of a k-core and a (k + 1)-chromatic graph

✍ Michael Molloy 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB 👁 1 views

We observe that the values of p for which with high probability Gm,p is k-colorable and for which with high probability G,,p has no k-core are not equal for k 2 4.

Minimum augmentation of a tree to a K-ed

Minimum augmentation of a tree to a K-edge-connected graph

✍ Shuichi Ueno; Yoji Kajitani; Hajime Wada 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB

The nonexistence of a (K6-e)-decompositi

The nonexistence of a (K6-e)-decomposition of the complete graph K29

✍ S. G. Hartke; P. R. J. Östergård; D. Bryant; S. I. El-Zanati 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB

## Abstract We show via an exhaustive computer search that there does not exist a (__K__~6~−__e__)‐decomposition of __K__~29~. This is the first example of a non‐complete graph __G__ for which a __G__‐decomposition of __K__~2|E(G)|+__1__~ does not exist. © 2009 Wiley Periodicals, Inc. J Combin Desi