✦ LIBER ✦

Pruning 2-Connected Graphs

✍ Scribed by Chandra Chekuri; Nitish Korula

Book ID: 106149161
Publisher: Springer
Year: 2010
Tongue: English
Weight: 857 KB
Volume: 62
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-010-9462-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

2-connected graphs with small 2-connecte

2-connected graphs with small 2-connected dominating sets

✍ Yair Caro; Raphael Yuster 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 101 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.

Connected, locally 2-connected, K1,3-fre

Connected, locally 2-connected, K1,3-free graphs are panconnected

✍ S. V. Kanetkar; P. R. Rao 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB 👁 1 views

## Abstract A graph __G__ is locally __n__‐connected, __n__ ≥ 1, if the subgraph induced by the neighborhood of each vertex is __n__‐connected. We prove that every connected, locally 2‐connected graph containing no induced subgraph isomorphic to __K__~1,3~ is panconnected.

2-Connected Spanning Subgraphs of Planar

2-Connected Spanning Subgraphs of Planar 3-Connected Graphs

✍ D.W. Barnette 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 278 KB

We prove that every planar 3-connected graph has a 2-connected spanning subgraph of maximum valence 15 . We give an example of a planar 3 -connected graph with no spanning 2-connected subgraph of maximum valence five. i) 1994 Academic Press, Inc.

Hamiltonicity of regular 2-connected gra

Hamiltonicity of regular 2-connected graphs

✍ Broersma, H. J.; van den Heuvel, J.; Jackson, B.; Veldman, H. J. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 832 KB

Let G be a k-regular 2-connected graph of order n. Jackson proved that G is hamiltonian if n 5 3k. Zhu and Li showed that the upper bound 3k on n can be relaxed to q k if G is 3-connected and k 2 63. We improve both results by showing that G is hamiltonian if n 5 gk -7 and G does not belong to a res