Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains
DOI10.1007/BF02570710zbMath0835.05065MaRDI QIDQ1900971
Publication date: 8 April 1996
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131406
adjacency matrixpolynomial-time algorithmpersistencyvisibility graphsimple polygonweak Bruhat ordermaximal chainsstaircase polygonspersistent graphs
Combinatorial aspects of representation theory (05E10) Graph theory (including graph drawing) in computer science (68R10) Combinatorics of partially ordered sets (06A07) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (11)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semispaces of configurations, cell complexes of arrangements
- A unified approach to visibility representations of planar graphs
- Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
- Generalized quadrangles associated with \(G_ 2(\)q)
- Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains
- DISTANCE VISIBILITY GRAPHS
- Recognizing visibility graphs of spiral polygons
- The Weak Bruhat Order of $\text{S}_\Sigma $, Consistent Sets, and Catalan Numbers
- VISIBILITY GRAPHS OF STAIRCASE POLYGONS WITH UNIFORM STEP LENGTH
This page was built for publication: Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains