Name
Abstract | ||
|---|---|---|
Jackson and Ordaz conjectured that if the stability number @a(G) of a graph G is no greater than its connectivity @k(G) then G is pancyclic. Applying Ramsey's theorem we prove the pancyclicity of every graph G with @k(G) sufficiently large with respect to @a(G). |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.disc.2003.11.045 | Discrete Mathematics |
Keywords | Field | DocType |
05c38,pancyclic graphs,hamiltonian graphs,05c45,stability number,cycles,connectivity,hamiltonian graph,connected graph | Discrete mathematics,Graph,Combinatorics,Ramsey's theorem,Connectivity,Mathematics | Journal |
Volume | Issue | ISSN |
286 | 1-2 | Discrete Mathematics |
Citations | PageRank | References |
3 | 0.47 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Evelyne Flandrin | 1 | 219 | 25.13 |
| Hao Li | 2 | 3 | 0.47 |
| Antoni Marczyk | 3 | 66 | 10.91 |
| Mariusz Woźniak | 4 | 204 | 34.54 |