✦ LIBER ✦

Flows in 3-edge-connected bidirected graphs

✍ Scribed by Erling Wei; Wenliang Tang; Xiaofeng Wang

Book ID: 107378042
Publisher: Higher Education Press and Springer
Year: 2011
Tongue: English
Weight: 143 KB
Volume: 6
Category: Article
ISSN: 1673-3452
DOI: 10.1007/s11464-011-0111-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Group Connectivity in 3-Edge-Connected G

Group Connectivity in 3-Edge-Connected Graphs

✍ Fan Yang, Xiangwen Li 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 154 KB

On 3-Edge-Connected Supereulerian Graphs

✍ Hong-Jian Lai; Hao Li; Yehong Shao; Mingquan Zhan 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 222 KB

Nowhere-zero 3-flows in locally connecte

Nowhere-zero 3-flows in locally connected graphs

✍ Hong-Jian Lai 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 91 KB 👁 1 views

## Abstract Let __G__ be a graph. For each vertex __v__ ∈__V__(__G__), __N~v~__ denotes the subgraph induces by the vertices adjacent to __v__ in __G__. The graph __G__ is locally __k__‐edge‐connected if for each vertex __v__ ∈__V__(__G__), __N~v~__ is __k__‐edge‐connected. In this paper we study t

Contractible edges in 3-connected graphs

✍ Kiyoshi Ando; Hikoe Enomoto; Akira Saito 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 371 KB

Removable edges in 3-connected graphs

✍ Derek A. Holton; Bill Jackson; Akira Saito; Nicholas C. Wormald 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 404 KB

## Abstract An edge __e__ of a 3‐connected graph __G__ is said to be __removable__ if __G__ ‐ __e__ is a subdivision of a 3‐connected graph. If __e__ is not removable, then __e__ is said to be __nonremovable.__ In this paper, we study the distribution of removable edges in 3‐connected graphs and pr

Eulerian subgraphs in 3-edge-connected g

Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs

✍ Zhi-Hong Chen; Hong-Jian Lai; Xiangwen Li; Deying Li; Jinzhong Mao 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB

## Abstract In this paper, we show that if __G__ is a 3‐edge‐connected graph with $S \subseteq V(G)$ and $|S| \le 12$, then either __G__ has an Eulerian subgraph __H__ such that $S \subseteq V(H)$, or __G__ can be contracted to the Petersen graph in such a way that the preimage of each vertex of th