𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Spanning eulerian subgraphs of bounded degree in triangulations

✍ Scribed by Zhicheng Gao; Nicholas C. Wormald

Publisher
Springer Japan
Year
1994
Tongue
English
Weight
439 KB
Volume
10
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A degree condition for spanning eulerian
A degree condition for spanning eulerian subgraphs
✍ Zhi-Hong Chen πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 571 KB

## Abstract Let __p__ β‰₯ __2__ be a fixed integer. Let __G__ be a simple and 2‐edge‐connected graph on __n__ vertices, and let __g__ be the girth of __G.__ If __d__(__u__) + __d__(__v__) β‰₯ (__2__/(__g βˆ’ 2__))((__n/p__) βˆ’ 4 + __g__) holds whenever __uv__ βˆ‰ __E__(__G__), and if __n__ is sufficiently l

Almost-Spanning Subgraphs with Bounded D
Almost-Spanning Subgraphs with Bounded Degree in Dense Graphs
✍ Yoshiyasu Ishigami πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 330 KB

We present two extensions of a theorem by Alon and Yuster (1992, Graphs Comb., 8, 95-102) that give degree conditions guaranteeing an almost-spanning subgraph isomorphic to a given graph. The first extension gives a sharp degree condition when the desired subgraph consists of small connected compone

The spanning subgraphs of eulerian graph
The spanning subgraphs of eulerian graphs
✍ F. T. Boesch; C. Suffel; R. Tindell πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 312 KB

## Abstract It is shown that a connected graph __G__ spans an eulerian graph if and only if __G__ is not spanned by an odd complete bigraph __K__(2~m~ + 1, 2__n__ + 1). A disconnected graph spans an eulerian graph if and only if it is not the union of the trivial graph with a complete graph of odd