Unit hypercube visibility numbers of trees

DOI10.1007/s00373-017-1779-2zbMath1371.05192arXiv1609.00983OpenAlexW2962734976MaRDI QIDQ2409537

Eric Peterson, Paul S. Wenger

Publication date: 11 October 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.00983

zbMATH Keywords

visibilitycubicity

Mathematics Subject Classification ID

Trees (05C05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Computational complexity aspects of point visibility graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unit rectangle visibility graphs
• Representing a planar graph by vertical lines joining different levels
• A unified approach to visibility representations of planar graphs
• Rectangle-visibility representations of bipartite graphs
• A characterisation of rigid circuit graphs
• Some results on point visibility graphs
• A note on rectilinear and polar visibility graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• The Unit Bar Visibility Number of a Graph
• Visibility Number of Directed Graphs
• Representations of chordal graphs as subtrees of a tree
• Rectangle-visibility Layouts of Unions and Products of Trees
• RECTANGLE AND BOX VISIBILITY GRAPHS IN 3D
• The Bar Visibility Number of a Graph
• Graph Drawing

This page was built for publication: Unit hypercube visibility numbers of trees