Name
Abstract | ||
|---|---|---|
It is proved that if G is a k-connected K\"1\",\"4-free graph and S is a subset of vertices such that k=3 and |S|@?2k then G has a cycle containing S. A similar result is obtained when restricting the k-connectivity assumption to the subset S. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.disc.2010.04.018 | Discrete Mathematics |
Keywords | DocType | Volume |
k 1,k-connected graph,k -connected graph,4 -free graph,subset of vertices,cyclability,k1,4-free graph | Journal | 310 |
Issue | ISSN | Citations |
20 | Discrete Mathematics | 1 |
PageRank | References | Authors |
0.37 | 2 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Evelyne Flandrin | 1 | 219 | 25.13 |
| Ervin Győri | 2 | 65 | 7.92 |
| Hao Li | 3 | 110 | 12.43 |
| Jinlong Shu | 4 | 99 | 24.28 |