Name
Abstract | ||
|---|---|---|
This paper presents sufficient conditions for a grid graph to be Hamiltonian. It is proved that all finite grid graphs of positive width have Hamiltonian line graphs. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1137/0405046 | SIAM J. Discrete Math. |
Keywords | Field | DocType |
grid graph,hamiltonian property,hamiltonian graph,line graph | Discrete mathematics,Combinatorics,Indifference graph,Modular decomposition,Hamiltonian path,Chordal graph,Hamiltonian path problem,Treewidth,1-planar graph,Mathematics,Pancyclic graph | Journal |
Volume | Issue | ISSN |
5 | 4 | 0895-4801 |
Citations | PageRank | References |
11 | 0.82 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christina Zamfirescu | 1 | 19 | 2.24 |
| Tudor Zamfirescu | 2 | 77 | 16.85 |