Segment endpoint visibility graphs are Hamiltonian
type: Item
instance of: scholarly article
title: Segment endpoint visibility graphs are Hamiltonian
zbMATH Open document ID: 1024.68111
DOI: 10.1016/S0925-7721(02)00172-4
author: D. Massart
published in: Computational Geometry
publication date: 2003-07-01T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 52A10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1944829
zbMATH Keywords: line segments
zbMATH Keywords: Hamiltonian graph
zbMATH Keywords: visibility graph
MaRDI profile type: Publication
cites work: Can visibility graphs be represented compactly?
cites work: Q4945520
cites work: Every set of disjoint line segments admits a binary tree
cites work: Planar segment visibility graphs
cites work: An Output-Sensitive Algorithm for Computing Visibility Graphs
cites work: VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME
cites work: Hamiltonian triangulations and circumscribing polygons of disjoint line segments
cites work: Q4401015
cites work: Two segment classes with Hamiltonian visibility graphs
cites work: Minimal tangent visibility graphs
cites work: Topologically sweeping visibility complexes via pseudotriangulations
cites work: Computing Simple Circuits from a Set of Line Segments is NP-Complete
cites work: Computing simple circuits from a set of line segments
cites work: A tight lower bound on the size of visibility graphs
cites work: On a counterexample to a conjecture of Mirzaian
cites work: Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
full work available at URL: s0925-7721(02)00172-4
OpenAlex ID: W2048707633
Recommended article: The visibility graph of congruent discs is Hamiltonian
Recommended article: Planar segment visibility graphs
Recommended article: Hamiltonian-connected graphs
Recommended article: Hamiltonian extendable graphs
Recommended article: Q5488886
Recommended article: Q3751608
Recommended article: Q4456500
Recommended article: Hamiltonian paths and hamiltonian connectivity in graphs
Recommended article: Connectivity and Hamiltonian connectedness of graphs
description: scientific article; zbMATH DE number 1944829