✦ LIBER ✦

Factors and Connected Induced Subgraphs

✍ Scribed by Keiko Kotani

Publisher: Springer Japan
Year: 2001
Tongue: English
Weight: 83 KB
Volume: 17
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s003730170025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Component factors and induced subgraphs

✍ Nishimura, Tsuyoshi 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB

Let G and K be connected graphs such that I GI = nlKl (n 2 2) and let p be a fixed integer satisfying 1 < p < n. We prove that if G \ A has a K-factor for every connected subgraph A with IAl = plKI, then G also has a K-factor.

Cyclomatic numbers of connected induced

Cyclomatic numbers of connected induced subgraphs

✍ Xingxing Yu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 509 KB

We give an upper bound for w(A), the minimum cyclomatic number of connected induced subgraphs containing a given independent set A of vertices in a given graph G. We also give an upper bound for w(A) when G is triangle-free. We show that these two bounds are best possible. Similar results are obtai

Forcing highly connected subgraphs

✍ Maya Jakobine Stein 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 228 KB

## Abstract A theorem of Mader states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. We extend this result to infinite graphs. Here, it is necessary to require not only high degree for the vertices but also high __vertex‐degree__ (or __multiplicity

Graphs with most number of three point i

Graphs with most number of three point induced connected subgraphs

✍ F.T. Boesch; X. Li; J. Rodriguez 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 678 KB

Two-edge connected spanning subgraphs an

Two-edge connected spanning subgraphs and polyhedra

✍ Ali Ridha Mahjoub 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 634 KB

Contractible subgraphs in k-connected gr

Contractible subgraphs in k-connected graphs

✍ Zemin Jin; Xingxing Yu; Xiaoyan Zhang 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB

## Abstract For a graph __G__ we define a graph __T__(__G__) whose vertices are the triangles in __G__ and two vertices of __T__(__G__) are adjacent if their corresponding triangles in __G__ share an edge. Kawarabayashi showed that if __G__ is a __k__‐connected graph and __T__(__G__) contains no ed