| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657237 | Journal of Combinatorial Theory, Series B | 2009 | 13 Pages |
Abstract
We prove that every finite 4-connected graph G has at least many contractible edges.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
