Minimal Embedding Dimensions of Rectangle k-Visibility Graphs

DOI10.7155/jgaa.00550zbMath1452.05181OpenAlexW3118674767MaRDI QIDQ5144882

Espen Slettnes

Publication date: 19 January 2021

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00550

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Products of unit distance graphs
• On the Euclidean dimension of a complete multipartite graph
• On unimodal subsequences
• Rectangle-visibility representations of bipartite graphs
• On the corona of two graphs
• On k-visibility graphs
• On the Metric Dimension of Cartesian Products of Graphs
• Further Results on Bar k-Visibility Graphs
• A new graph product and its spectrum
• RECTANGLE AND BOX VISIBILITY GRAPHS IN 3D
• Bar k-Visibility Graphs
• On a Combinatorial Problem in Number Theory

This page was built for publication: Minimal Embedding Dimensions of Rectangle k-Visibility Graphs