Hamiltonian cycles in T-graphs (Q1580773): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s004540010051 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2080396663 / rank | |||
Normal rank |
Latest revision as of 23:21, 19 March 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