scientific article
From MaRDI portal
Publication:3139724
zbMath0786.05077MaRDI QIDQ3139724
Hua Lin, Sekhar Pisupati, James Abello
Publication date: 11 November 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmconnectivityHamiltonian cyclemaximum cliquevisibility graphsmaximally planarGhosh's conjecture
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)
Related Items (5)
Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains ⋮ On recognizing and characterizing visibility graphs of simple polygons ⋮ Disproving a conjecture on planar visibility graphs ⋮ Visibility Graphs of Anchor Polygons ⋮ A necessary condition for a graph to be the visibility graph of a simple polygon
This page was built for publication:
