On the Bar Visibility Number of Complete Bipartite Graphs

DOI10.1137/19M1260268zbMath1475.05121arXiv1905.01874OpenAlexW3204773692MaRDI QIDQ5157389

Wei-Ting Cao, Yan Yang, Douglas B. West

Publication date: 18 October 2021

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

thicknesscomplete bipartite graphplanar graphbar visibility graphbar visibility number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• A unified approach to visibility representations of planar graphs
• A short solution of Heawood's empire problem in the plane
• On the planar split thickness of graphs
• Thickness and outerthickness for embedded graphs
• Upper bounds for bar visibility of subgraphs and \(n\)-vertex graphs
• Bar visibility numbers for hypercubes and outerplanar digraphs
• A note on rectilinear and polar visibility graphs
• Visibility Number of Directed Graphs
• Solution of Heawood's empire problem in the plane.
• The Thickness of the Cartesian Product of Two Graphs
• The Bar Visibility Number of a Graph
• Visibility Algorithms in the Plane
• A class of thickness-minimal graphs
• Note on T-Minimal Complete Bipartite Graphs

This page was built for publication: On the Bar Visibility Number of Complete Bipartite Graphs