Two segment classes with Hamiltonian visibility graphs (Q1334612): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0925-7721(94)90019-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2031282410 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3997899 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hamiltonian triangulations and circumscribing polygons of disjoint line segments / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Good splitters for counting points in triangles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing simple circuits from a set of line segments / rank | |||
Normal rank | |||
Latest revision as of 17:59, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two segment classes with Hamiltonian visibility graphs |
scientific article |
Statements
Two segment classes with Hamiltonian visibility graphs (English)
0 references
25 September 1994
0 references
It has been conjectured that the visibility graph of a set of non- collinear disjoint line segments always contains a simple Hamiltonian circuit. The general problem and the problem for so-called shellable segments remain open, but the authors show that the conjecture holds for the class of independent segments (the line containing each segment misses all the other segments) and for the class of unit lattice segments (unit length segments whose endpoints have integer coordinates).
0 references
visibility graph
0 references
Hamiltonian circuit
0 references
