Abstract | ||
---|---|---|
For a set X of vertices of a graph fulfilling local connectedness conditions, the existence of a cycle containing X is proved. |
Year | DOI | Venue |
---|---|---|
2006 | 10.1016/j.disc.2005.12.021 | Discrete Mathematics |
Keywords | Field | DocType |
cycle,specified vertices,connectivity,toughness | Graph center,Discrete mathematics,Wheel graph,Combinatorics,Graph power,Graph homomorphism,Cycle graph,Distance,Neighbourhood (graph theory),Mathematics,Path graph | Journal |
Volume | Issue | ISSN |
306 | 8-9 | Discrete Mathematics |
Citations | PageRank | References |
2 | 0.42 | 7 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Tobias Gerlach | 1 | 8 | 2.40 |
Frank Göring | 2 | 53 | 9.00 |
Jochen Harant | 3 | 217 | 30.62 |
michal tkac | 4 | 58 | 6.79 |