| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4648272 | Discrete Mathematics | 2010 | 9 Pages |
Abstract
A graph is said to be kk-extendable if any independent set of kk edges extends to a perfect matching. In this paper, we shall characterize the forbidden structures for 5-connected graphs on the Klein bottle to be 2-extendable. This fact also gives us a sharp lower bound of representativity of 5-connected graphs embedded on the Klein bottle to have such a property, which was considered in Kawarabayashi et al. (submitted for publication) [4].
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Seiya Negami, Yusuke Suzuki,