𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The 2-extendability of 5-connected graphs on the Klein bottle

✍ Scribed by Seiya Negami; Yusuke Suzuki

Book ID
108114246
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
472 KB
Volume
310
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Drawing Disconnected Graphs on the Klein
Drawing Disconnected Graphs on the Klein Bottle
✍ Laurent Beaudou; Antoine Gerbaud; Roland Grappe; FrΓ©dΓ©ric Palesi πŸ“‚ Article πŸ“… 2010 πŸ› Springer Japan 🌐 English βš– 140 KB
6-Critical Graphs on the Klein Bottle
6-Critical Graphs on the Klein Bottle
✍ Kawarabayashi, Ken-ichi; Kral', Daniel; Kynl, Jan; Lidicky, Bernard πŸ“‚ Article πŸ“… 2009 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 415 KB
Five-coloring graphs on the Klein bottle
Five-coloring graphs on the Klein bottle
✍ Nathan Chenette; Luke Postle; Noah Streib; Robin Thomas; Carl Yerger πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 554 KB
On the 2-extendability of the generalize
On the 2-extendability of the generalized Petersen graphs
✍ Gerald Schrag; Larry Cammack πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 731 KB

A graph G is n-extendable if it is connected, contains a set of rr independent edges and every set of n-independent edges extends to (i.e. is a subset of) a perfect matching. Combining the results of this and previous papers we answer the question of 2-extendability for all the generalized Petersen

On the orientable genus of graphs embedd
On the orientable genus of graphs embedded in the klein bottle
✍ Neil Robertson; Robin Thomas πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 560 KB

## Abstract Let __G__ be a graph embedded in the Klein bottle with β€œrepresentativity” at least four. We give a formula for the orientable genus of __G__, which also implies a polynomially bounded algorithm. The formula is in terms of the number of times certain closed curves on the Klein bottle int