𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Binding number and minimum degree for k-factors

✍ Scribed by Norihide Tokushige

Publisher
John Wiley and Sons
Year
1989
Tongue
English
Weight
282 KB
Volume
13
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Degree sequence conditions for equal edg
Degree sequence conditions for equal edge-connectivity and minimum degree, depending on the clique number
✍ Lutz Volkmann 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB

## Abstract Using the well‐known Theorem of Turán, we present in this paper degree sequence conditions for the equality of edge‐connectivity and minimum degree, depending on the clique number of a graph. Different examples will show that these conditions are best possible and independent of all the

Toughness, minimum degree, and the exist
Toughness, minimum degree, and the existence of 2-factors
✍ D. Bauer; E. Schmeichel 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 690 KB

## Abstract Degree conditions on the vertices of a __t__‐tough graph __G__(1 ≦ __t__ ≦ 2) that ensure the existence of a 2‐factor in __G__ are presented. These conditions are asymptotically best possible for every __t__ ϵ [1, 3/2] and for infinitely many __t__ ϵ [3/2, 2].

On k-domination and minimum degree in gr
On k-domination and minimum degree in graphs
✍ Odile Favaron; Adriana Hansberg; Lutz Volkmann 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 1 views

## Abstract A subset __S__ of vertices of a graph __G__ is __k__‐dominating if every vertex not in __S__ has at least __k__ neighbors in __S__. The __k__‐domination number $\gamma\_k(G)$ is the minimum cardinality of a __k__‐dominating set of __G__. Different upper bounds on $\gamma\_{k}(G)$ are kn

Models and heuristics for the k -degree
Models and heuristics for the k -degree constrained minimum spanning tree problem with node-degree costs
✍ Christophe Duhamel; Luís Gouveia; Pedro Moura; Maurício de Souza 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 319 KB 👁 1 views

## Abstract The __k__ ‐Degree constrained Minimum Spanning Tree Problem (__k__ ‐DMSTP) consists in finding a minimal cost spanning tree satisfying the condition that every node has a degree no greater than a fixed value __k__. Here we consider an extension where besides the edge costs, a concave co