Obstacle numbers of graphs
type: Item
instance of: scholarly article
title: Obstacle numbers of graphs
zbMATH Open document ID: 1216.05088
author: Hannah Alpert
author: Christina L. Koch
author: Joshua D. Laison
published in: Discrete \& Computational Geometry
publication date: 2010-06-21T00:00:00Z
Mathematics Subject Classification ID: 05C62
zbMATH DE Number: 5723616
zbMATH Keywords: obstacle number
zbMATH Keywords: convex obstacle number
zbMATH Keywords: circular arc graph
zbMATH Keywords: proper circular arc graph
zbMATH Keywords: non-double-covering circular arc graph
zbMATH Keywords: interval bigraph
zbMATH Keywords: visibility graph
MaRDI profile type: Publication
full work available at URL: s00454-009-9233-8
OpenAlex ID: W2047417978
cites work: Q4547794
cites work: Research Problems in Discrete Geometry
cites work: Q4677831
cites work: Q4529254
cites work: Q4430834
cites work: Q4405755
cites work: Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
cites work: Polynomial time recognition of unit circular-arc graphs
cites work: Q4028120
cites work: Algorithmic graph theory and perfect graphs
cites work: Two remarks on circular arc graphs
cites work: Interval bigraphs and circular arc graphs
cites work: Linear-time recognition of circular-arc graphs
cites work: Topics in Intersection Graph Theory
cites work: The Erdos-Szekeres problem on points in convex position – a survey
cites work: Q3799261
cites work: Small Ramsey numbers
cites work: Circular-arc graphs with clique cover number two
cites work: Q5290279
cites work: Characterizing circular-arc graphs
cites work: Matrix characterizations of circular-arc graphs
DOI: 10.1007/S00454-009-9233-8
description: scientific article; zbMATH DE number 5723616