Name
Abstract | ||
|---|---|---|
graph G is called k-ordered if for any sequence of k distinct vertices of G, there exists a cycle in G through these vertices in the given order. A vertex set S is called cyclable in G if there exists a cycle passing through all vertices of S. We will define ''set-orderedness'' which is a natural generalization of k-orderedness and cyclability. We also give a degree sum condition for graphs to satisfy ''set-orderedness''. This is an extension of well-known sufficient conditions on k-orderedness. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.disc.2010.05.005 | Discrete Mathematics |
Keywords | Field | DocType |
cyclable,k -ordered,degree sum,k-ordered,satisfiability,k | Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Existential quantification,Mathematics | Journal |
Volume | Issue | ISSN |
310 | 17-18 | Discrete Mathematics |
Citations | PageRank | References |
1 | 0.35 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Keishi Ishii | 1 | 1 | 0.35 |
| Kenta Ozeki | 2 | 138 | 36.31 |
| Kiyoshi Yoshimoto | 3 | 133 | 22.65 |