Name
Abstract | ||
|---|---|---|
Let G be a triangle-free graph with δ(G) ≥ 2 and σ4(G) ≥ |V (G)| + 2. Let S ⊂ V (G) consist of less than σ4/4 + 1 vertices. We prove the following. If all vertices of S have degree at least three, then there exists a cycle C containing S. Both the upper bound on |S| and the lower bound on σ4 are best possible. |
Year | Venue | Keywords |
|---|---|---|
2007 | Discussiones Mathematicae - Graph Theory | cycle,triangle-free graph.,path,triangle free graph,upper bound,lower bound |
Field | DocType | Volume |
Graph center,Discrete mathematics,Combinatorics,Strongly regular graph,Bound graph,Graph power,Cycle graph,Neighbourhood (graph theory),Mathematics,Triangle-free graph,Path graph | Journal | 27 |
Issue | Citations | PageRank |
1 | 2 | 0.44 |
References | Authors | |
10 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel Paulusma | 1 | 102 | 14.89 |
| Kiyoshi Yoshimoto | 2 | 133 | 22.65 |