Name
Abstract | ||
|---|---|---|
The square of a graph is obtained by adding additional edges joining all pair of vertices of distance two in the original graph. Particularly, if $$C$$C is a hamiltonian cycle of a graph $$G$$G, then the square of $$C$$C is called a hamiltonian square of $$G$$G. In this paper, we characterize all possible forbidden pairs, which implies the containment of a hamiltonian square, in a 4-connected graph. The connectivity condition is necessary as, except $$K_3$$K3 and $$K_4$$K4, the square of a cycle is always 4-connected. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/s00373-015-1524-7 | Graphs and Combinatorics |
Keywords | Field | DocType |
Hamiltonian square, Forbidden pair | Topology,Complete graph,Discrete mathematics,Combinatorics,Graph power,Hamiltonian path,Quartic graph,Cycle graph,Hamiltonian path problem,Butterfly graph,Mathematics,Complement graph | Journal |
Volume | Issue | ISSN |
31 | 6 | 1435-5914 |
Citations | PageRank | References |
0 | 0.34 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guantao Chen | 1 | 107 | 25.00 |
| Songling Shan | 2 | 20 | 9.16 |