Upper bounds for bar visibility of subgraphs and \(n\)-vertex graphs
From MaRDI portal
Publication:2192084
DOI10.1016/j.dam.2020.01.011zbMath1442.05139arXiv1904.08707MaRDI QIDQ2192084
Yuanrui Feng, Yan Yang, Douglas B. West
Publication date: 29 June 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.08707
05C10: Planar graphs; geometric and topological aspects of graph theory
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
Cites Work
- A unified approach to visibility representations of planar graphs
- A short solution of Heawood's empire problem in the plane
- Gallai's path decomposition conjecture for graphs of small maximum degree
- On the planar split thickness of graphs
- Solution of Heawood's empire problem in the plane.
- The Bar Visibility Number of a Graph