Connected proper interval graphs and the guard problem in spiral polygons (extended abstract)

DOI10.1007/3-540-61576-8_71zbMATH Open1543.68274MaRDI QIDQ6567668

Chin-Chen Chang, Chiuyuan Chen

Publication date: 5 July 2024

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Eulerian and Hamiltonian graphs (05C45) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals
• Finding Hamiltonian circuits in proper interval graphs
• Finding Hamiltonian circuits in interval graphs
• The edge Hamiltonian path problem is NP-complete
• Incidence matrices and interval graphs
• Recognizing visibility graphs of spiral polygons
• The Hamiltonian Circuit Problem is Polynomial for 4-Connected Planar Graphs
• Covering the edges with consecutive sets
• An $O(n^2 \log n)$ Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Hamilton Paths in Grid Graphs
• Reducibility among Combinatorial Problems
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• A Characterization of Comparability Graphs and of Interval Graphs

Related Items (1)

Semi-proper interval graphs

This page was built for publication: Connected proper interval graphs and the guard problem in spiral polygons (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567668)