Unimaximal Sequences of Pairs in Rectangle Visibility Drawing

DOI10.1007/978-3-642-00219-9_7zbMath1213.68421OpenAlexW1493145040MaRDI QIDQ3611837

Jan Štola

Publication date: 3 March 2009

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00219-9_7

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (4)

Visibility representations of boxes in 2.5 dimensions ⋮ Colored anchored visibility representations in 2D and 3D space ⋮ On 3D visibility representations of graphs with few crossings per edge ⋮ Edge Partitions and Visibility Representations of 1-planar Graphs

Cites Work

• On unimodal subsequences
• A Visibility Representation for Graphs in Three Dimensions
• Colorability in Orthogonal Graph Drawing

This page was built for publication: Unimaximal Sequences of Pairs in Rectangle Visibility Drawing