𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Regular connected bipancyclic spanning subgraphs of hypercubes

✍ Scribed by S.A. Mane; B.N. Waphare

Book ID
113512057
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
229 KB
Volume
62
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

2-Connected Spanning Subgraphs of Planar
2-Connected Spanning Subgraphs of Planar 3-Connected Graphs
✍ D.W. Barnette πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 278 KB

We prove that every planar 3-connected graph has a 2-connected spanning subgraph of maximum valence 15 . We give an example of a planar 3 -connected graph with no spanning 2-connected subgraph of maximum valence five. i) 1994 Academic Press, Inc.

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