Name
Abstract | ||
|---|---|---|
Let G be a (k+m)-connected graph and F be a linear forest in G such that |E(F)|=m and F has at most k-2 components of order 1, where k=2 and m=0. In this paper, we prove that if every independent set S of G with |S|=k+1 contains two vertices whose degree sum is at least d, then G has a cycle C of length at least min{d-m,|V(G)|} which contains all the vertices and edges of F. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.disc.2007.05.005 | Discrete Mathematics |
Keywords | Field | DocType |
linear forest,long cycle,degree sum,connected graph,independent set | Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Independent set,Connectivity,Mathematics | Journal |
Volume | Issue | ISSN |
308 | 12 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jun Fujisawa | 1 | 9 | 1.51 |
| Tomoki Yamashita | 2 | 96 | 22.08 |