𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On some connectivity properties of Eulerian graphs

✍ Scribed by L. Lovász

Publisher
Akadmiai Kiad
Year
1976
Tongue
English
Weight
463 KB
Volume
28
Category
Article
ISSN
1588-2632

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two-connected orientations of Eulerian g
Two-connected orientations of Eulerian graphs
✍ Alex R. Berg; Tibor Jordán 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB

## Abstract A graph __G__ = (__V__, __E__) is said to be weakly four‐connected if __G__ is 4‐edge‐connected and __G__ – __x__ is 2‐edge‐connected for every __x__ ∈ __V__. We prove that every weakly four‐connected Eulerian graph has a 2‐connected Eulerian orientation. This verifies a special case of

A charcterization of 4-edge-connected eu
A charcterization of 4-edge-connected eulerian graphs
✍ Peter Weidl 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 594 KB

## Abstract Let __v__ be an arbitrary vertex of a 4‐edge‐connected Eulerian graph __G__. First we show the existence of a nonseparating cycle decompositiion of __G__ with respect to __v__. With the help of this decomposition we are then able to construct 4 edge‐independent spanning trees with the c

On local connectivity of graphs
On local connectivity of graphs
✍ Lutz Volkmann 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 151 KB

The local connectivity κ(u, v) of two vertices u and v in a graph G is the maximum number of internally disjoint u-v paths in G, and the connectivity of G is defined as } for all pairs u and v of vertices in G. Let δ(G) be the minimum degree of G. We call a graph G maximally connected when κ(G) = δ

On Group Connectivity of Graphs
On Group Connectivity of Graphs
✍ Hong-Jian Lai; Rui Xu; Ju Zhou 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 133 KB
On some conjectures on cubic 3-connected
On some conjectures on cubic 3-connected graphs
✍ Jean-Luc Fouquet; Henri Thuillier 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 969 KB

Our purpose is to consider the following conjectures: Conjecture 1 (Barneffe). . Every cubic 3-connected bipartite planar graph is Hamiltonian. Conjecture 2 (Jaeger). Every cubic cyclically 4-edge connected graph G has a cycle C such that G -V(C) is acyclic. Conjecture 3 (Jackson, Fleischner). Ever