✦ LIBER ✦

2-connected graphs with small 2-connected dominating sets

✍ Scribed by Yair Caro; Raphael Yuster

Book ID: 108315875
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 101 KB
Volume: 269
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(03)00055-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on dominating cycles in 2-connect

A note on dominating cycles in 2-connected graphs

✍ D. Bauer; E. Schmeichel; H.J. Veldman 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 277 KB

2-connected and 2-edge-connected Steinha

2-connected and 2-edge-connected Steinhaus graphs

✍ Dongju Kim; Daekeun Lim 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 131 KB

Pruning 2-Connected Graphs

✍ Chandra Chekuri; Nitish Korula 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 857 KB

On approximation algorithms of -connecte

On approximation algorithms of -connected -dominating sets in disk graphs

✍ My T. Thai; Ning Zhang; Ravi Tiwari; Xiaochun Xu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 590 KB

Minimally 2-edge connected graphs

✍ G. Chaty; M. Chein 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 338 KB

## Abstract A constructive characterization of minimally 2‐edge connected graphs, similar to those of Dirac for minimally 2‐connected graphs is given.

Hamiltonicity in 2-connected graphs with

Hamiltonicity in 2-connected graphs with claws

✍ Hao Li; Mei Lu; Zhiren Sun 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 562 KB

Matthews and Sumner have proved in [12] that if G is a 2-connected claw-free graph of order n such that 6>~(n-2)/3, then G is hamiltonian. Li has shown that the bound for the minimum degree 6 can be reduced to n/4 under the additional condition that G is not in /7, where /7 is a class of graphs defi