✦ LIBER ✦

The k-nucleus of a graph

✍ Scribed by Peter J. Slater

Publisher: John Wiley and Sons
Year: 1981
Tongue: English
Weight: 467 KB
Volume: 11
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230110302

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Counting k-component forests of a graph

✍ Wendy Myrvold 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 331 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

A note on the k-degree Cayley graph

✍ Yuuki Tanaka; Yukio Shibata 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 69 KB

K4−-factor in a graph

✍ Ken-ichi Kawarabayashi 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

## Abstract Let __G__ be a graph of order 4__k__ and let δ(__G__) denote the minimum degree of __G__. Let __F__ be a given connected graph. Suppose that |__V__(__G__)| is a multiple of |__V__(__F__)|. A spanning subgraph of __G__ is called an __F__‐factor if its components are all isomorphic to __F

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.

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