✦ LIBER ✦

Degree constrained subgraphs

✍ Scribed by L. Addario-Berry; K. Dalal; B.A. Reed

Book ID: 108112676
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 163 KB
Volume: 156
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2007.05.059

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parameterized complexity of finding smal

Parameterized complexity of finding small degree-constrained subgraphs

✍ Omid Amini; Ignasi Sau; Saket Saurabh 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 362 KB

Machine sequencing: Disjunctive graphs a

Machine sequencing: Disjunctive graphs and degree-constrained subgraphs

✍ Egon Balas 📂 Article 📅 1970 🏛 John Wiley and Sons 🌐 English ⚖ 578 KB

Another look at the degree constrained s

Another look at the degree constrained subgraph problem

✍ Yossi Shiloach 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 533 KB

On the approximability of some degree-co

On the approximability of some degree-constrained subgraph problems

✍ Omid Amini; David Peleg; Stéphane Pérennes; Ignasi Sau; Saket Saurabh 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 389 KB

A note on degree-constrained star subgra

A note on degree-constrained star subgraphs of bipartite graphs

✍ Harold N. Gabow 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 666 KB

Subgraphs of minimal degree k

✍ P. Erdo&#x030B;s; R.J. Faudree; C.C. Rousseau; R.H. Schelp 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 392 KB

## For k 2 2, any graph G with n vertices and (k -1) (n -k + 2) + (" 1') edges has a subgraph of minimum degree at least k; however, this subgraph need not be proper. It is shown that if G has at least (k -1) (n -k + 2) + (e ;') + 1 edges, then there is a subgraph H of minimal degree k that has at