Unimaximal Sequences of Pairs in Rectangle Visibility Drawing

DOI10.1007/978-3-642-00219-9_7MaRDI QIDQ3611837zbMATH OpenOpenAlexFDO

Authors 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 representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• RECTANGLE AND BOX VISIBILITY GRAPHS IN 3D
• A Visibility Representation for Graphs in Three Dimensions
• scientific article; zbMATH DE number 1228438
• Directed rectangle-visibility graphs have unbounded dimension
• scientific article; zbMATH DE number 1250670

Cites work

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

Cited in

(3)

• 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

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

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