✦ LIBER ✦

Connectivity and tree structure in finite graphs

✍ Scribed by Carmesin, Johannes; Diestel, Reinhard; Hundertmark, Fabian; Stein, Maya

Book ID: 125348554
Publisher: Springer-Verlag
Year: 2014
Tongue: English
Weight: 655 KB
Volume: 34
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-014-2898-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Star complements and connectivity in fin

Star complements and connectivity in finite graphs

✍ Rowlinson, Peter 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 358 KB

Connectivity keeping trees in k-connecte

Connectivity keeping trees in k-connected graphs

✍ W. Mader 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 86 KB

We show that one can choose the minimum degree of a k-connected graph G large enough (independent of the vertex number of G) such that G contains a copy T of a prescribed tree with the property that G -V (T ) remains k-connected.

Connected Factors and Spanning Trees in

Connected Factors and Spanning Trees in Graphs

✍ Taro Tokuda; Baoguang Xu; Jianfang Wang 📂 Article 📅 2003 🏛 Springer Japan 🌐 English ⚖ 81 KB

Rainbow trees in graphs and generalized

Rainbow trees in graphs and generalized connectivity

✍ Gary Chartrand; Futaba Okamoto; Ping Zhang 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB

Quasi-isometries between non-locally-fin

Quasi-isometries between non-locally-finite graphs and structure trees

✍ B. Krön 📂 Article 📅 2001 🏛 Vandenhoeck & Ruprecht 🌐 German ⚖ 902 KB

Permutation graphs: Connected domination

Permutation graphs: Connected domination and Steiner trees

✍ Charles J. Colbourn; Lorna K. Stewart 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 702 KB

Efficient algorithms are developed for finding a minimum cardinality connected dominating set and a minimum cardinality Steiner tree in permutation graphs. This contrasts with the known NP-completeness of both problems on comparability graphs in general.