✦ LIBER ✦

Conditions for families of disjoint -connected subgraphs in a graph

✍ Scribed by Ferrara, Michael; Magnant, Colton; Wenger, Paul

Book ID: 118734288
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 207 KB
Volume: 313
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.12.013

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge-disjoint minimum-weight connected s

Edge-disjoint minimum-weight connected spanning k-edge subgraphs in a weighted graph: A connectedness theorem

✍ Xueliang Li 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 403 KB

Forbidden subgraphs and hamiitonian prop

Forbidden subgraphs and hamiitonian properties in the square of a connected graph

✍ Ronald J. Gould; Michael S. Jacobson 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 331 KB 👁 1 views

Various Hamiltonian-like properties are investigated in the squares of connected graphs free of some set of forbidden subgraphs. The star K,+ the subdivision graph of &, and the subdivision graph of K1,3 minus an endvertex play central roles. In particular, we show that connected graphs free of the

The connectivity of the SEE-graph and AE

The connectivity of the SEE-graph and AEE-graph for the connected spanning k-edge subgraphs of a graph

✍ Xueliang Li 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 447 KB

A linear-time algorithm for finding a sp

A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph

✍ Hiroshi Nagamochi; Toshihide Ibaraki 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 684 KB

Maximum number of disjoint paths connect

Maximum number of disjoint paths connecting specified terminals in a graph

✍ Hananya Yinnone 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 907 KB

On a Sharp Degree Sum Condition for Disj

On a Sharp Degree Sum Condition for Disjoint Chorded Cycles in Graphs

✍ Shuya Chiba; Shinya Fujita; Yunshu Gao; Guojun Li 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 217 KB