| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9513259 | Discrete Mathematics | 2005 | 4 Pages |
Abstract
The following result is proved that corrects an error in an earlier paper. Every non-planar cyclically 3-edge connected 3-regular graph G contains an even circuit C for which G-E(C) is connected.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
![Erratum to “On removable even circuits in graphs” [Discrete Math. 286 (2004) 177-184]](/preview/png/9513259.png "First Page Preview: Erratum to “On removable even circuits in graphs” [Discrete Math. 286 (2004) 177-184]")
Authors
Philip A. Sinclair,