Name
Abstract | ||
|---|---|---|
Let G be a graph and S a subset of V(G). Let @a(S) denote the maximum number of pairwise nonadjacent vertices in the subgraph G of G induced by S. If G is not complete, let @k(S) denote the smallest number of vertices separating two vertices of S and @k(S)=|S|-1 otherwise. We prove that if @a(S)= |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.disc.2005.11.093 | Discrete Mathematics |
Keywords | Field | DocType |
05c38,independence number,pancyclic graphs,hamiltonian graphs,05c45,pancyclability,cyclability,cycles,connectivity,hamiltonian graph | Discrete mathematics,Graph,Combinatorics,Independence number,Vertex (geometry),Hamiltonian path,Connectivity,Mathematics | Journal |
Volume | Issue | ISSN |
307 | 11-12 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Evelyne Flandrin | 1 | 219 | 25.13 |
| Hao Li | 2 | 0 | 0.34 |
| Antoni Marczyk | 3 | 66 | 10.91 |
| Mariusz Woźniak | 4 | 204 | 34.54 |