Hamiltonian cycles in T-graphs (Q1580773): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
Property / author | |||
Property / author: John R. Reay / rank | |||
Property / author | |||
Property / author: Tudor I. Zamfirescu / rank | |||
Property / reviewed by | |||
Property / reviewed by: Stanlislav Jendroľ / rank | |||
Revision as of 06:28, 15 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Hamiltonian cycles in T-graphs |
scientific article |
Statements
Hamiltonian cycles in T-graphs (English)
0 references
23 January 2001
0 references
The vertices and polygonal edges of the planar Archimedean tiling \(3^6\) of the plane is called the triangular tiling graph (TTG). A subgraph \(G\) of TTG is linearly convex if, for every line \(L\) which contains an edge of TTG, the set \(L \cap G\) is a (possibly degenerated or empty) line segment. A T-graph is any nontrivial, finite, linearly convex, 2-connected subgraph of TTG. The authors prove that with only one exeption, any T-graph contains a Hamiltonian cycle.
0 references
Archimedean triangular tiling
0 references
Hamiltonian cycle
0 references
T-graph
0 references