✦ LIBER ✦

Minimum degree, leaf number and traceability

✍ Scribed by Simon Mukwembi

Book ID: 120964964
Publisher: Springer
Year: 2013
Tongue: English
Weight: 121 KB
Volume: 63
Category: Article
ISSN: 0011-4642
DOI: 10.1007/s10587-013-0036-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum degree and minimum number of edg

Minimum degree and minimum number of edge-disjoint trees

✍ A. Lladó; S.C. Lopez 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 234 KB

Minimum degree, independence number and

Minimum degree, independence number and regular factors

✍ Thomas Niessen 📂 Article 📅 1995 🏛 Springer Japan 🌐 English ⚖ 643 KB

Minimum degree algorithms for stability

Minimum degree algorithms for stability number

✍ Igor É. Zverovich 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 222 KB

Mahadev and Reed (J. Graph Theory 30(2) (1999) 113) found a ÿnite forbidden induced subgraph characterization for the maximal hereditary class of graphs where a minimum degree greedy algorithm produces a maximum stable set. We extend this class.

Binding number and minimum degree for k-

Binding number and minimum degree for k-factors

✍ Norihide Tokushige 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 282 KB

Binding Number, Minimum Degree, and Cycl

Binding Number, Minimum Degree, and Cycle Structure in Graphs

✍ D. Bauer; E. Schmeichel 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 504 KB

Domination number in graphs with minimum

Domination number in graphs with minimum degree two

✍ Er Fang Shan; Moo Young Sohn; Xu Dong Yuan; Michael A. Henning 📂 Article 📅 2009 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 264 KB