𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Contractions of graphs with no spanning eulerian subgraphs

✍ Scribed by P. A. Catlin

Publisher
Springer-Verlag
Year
1988
Tongue
English
Weight
389 KB
Volume
8
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Spanning subgraphs of random graphs
Spanning subgraphs of random graphs
✍ Noga Alon; ZoltΓ‘n FΓΌredi πŸ“‚ Article πŸ“… 1992 πŸ› Springer Japan 🌐 English βš– 183 KB
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

Spanning even subgraphs of 3-edge-connec
Spanning even subgraphs of 3-edge-connected graphs
✍ Bill Jackson; Kiyoshi Yoshimoto πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 344 KB

## Abstract By Petersen's theorem, a bridgeless cubic graph has a 2‐factor. H. Fleischner extended this result to bridgeless graphs of minimum degree at least three by showing that every such graph has a spanning even subgraph. Our main result is that, under the stronger hypothesis of 3‐edge‐connec