Publication:3139724
From MaRDI portal
zbMath0786.05077MaRDI QIDQ3139724
Hua Lin, Sekhar Pisupati, James Abello
Publication date: 11 November 1993
algorithm; connectivity; Hamiltonian cycle; maximum clique; visibility graphs; maximally planar; Ghosh's conjecture
05C35: Extremal problems in graph theory
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
05C10: Planar graphs; geometric and topological aspects of graph theory
05C85: Graph algorithms (graph-theoretic aspects)
05C40: Connectivity
05C45: Eulerian and Hamiltonian graphs
Related Items
Visibility Graphs of Anchor Polygons, Disproving a conjecture on planar visibility graphs, On recognizing and characterizing visibility graphs of simple polygons, A necessary condition for a graph to be the visibility graph of a simple polygon, Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains