𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On 3-Edge-Connected Supereulerian Graphs

✍ Scribed by Hong-Jian Lai; Hao Li; Yehong Shao; Mingquan Zhan

Book ID
106047910
Publisher
Springer Japan
Year
2010
Tongue
English
Weight
222 KB
Volume
27
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Flows in 3-edge-connected bidirected gra
Flows in 3-edge-connected bidirected graphs
✍ Erling Wei; Wenliang Tang; Xiaofeng Wang πŸ“‚ Article πŸ“… 2011 πŸ› Higher Education Press and Springer 🌐 English βš– 143 KB
Supereulerian complementary graphs
Supereulerian complementary graphs
✍ Hong-Jian Lai πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 541 KB

## Abstract NebeskΓ½ in [12] show that for any simple graph with __n__ β‰₯ 5 vertices, either __G__ or __G^c^__ contains an eulerian subgraph with order at least __n__ ‐ 1, with an explicitly described class of exceptional graphs. In this note, we show that if __G__ is a simple graph with __n__ β‰₯ 61 v

On perfectly two-edge connected graphs
On perfectly two-edge connected graphs
✍ Ali Ridha Mahjoub πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 1009 KB

This paper studies the graphs for which the 2-edge connected spanning subgraph polytope is completely described by the trivial inequalities and the so-called cut inequalities. These graphs are called perfectly 2-edge connected. The class of perfectly 2-edge connected graphs contains for instance the