Minimal embedding dimensions of rectangle k-visibility graphs

DOI10.7155/JGAA.00550MaRDI QIDQ5144882zbMATH OpenOpenAlexFDO

Authors Espen Slettnes

Publication date 19 January 2021

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

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

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

Recommendations

• RECTANGLE AND BOX VISIBILITY GRAPHS IN 3D
• A Visibility Representation for Graphs in Three Dimensions
• Directed rectangle-visibility graphs have unbounded dimension
• Thickness of Bar 1-Visibility Graphs
• Rectangle-visibility representations of bipartite graphs

Cites work

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

Cited in

(2)

• Area, perimeter, height, and width of rectangle visibility graphs
• Directed rectangle-visibility graphs have unbounded dimension

This page was built for publication: Minimal embedding dimensions of rectangle \(k\)-visibility graphs

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