Characterization and a 2D Visualization of B$_0$-VPG Cocomparability Graphs
Abstract
B-VPG graphs are intersection graphs of vertical and horizontal line segments on a plane. Cohen, Golumbic, Trotter, and Wang [Order, 2016] pose the question of characterizing B-VPG permutation graphs. We respond here by characterizing B-VPG cocomparability graphs. This characterization also leads to a polynomial time recognition and B-VPG drawing algorithm for the class. Our B-VPG drawing algorithm starts by fixing any one of the many posets whose cocomparability graph is the input graph . The drawing we obtain not only visualizes in that one can distinguish comparable pairs from incomparable ones, but one can also identify which among a comparable pair is larger in from this visualization.
Keywords
Cite
@article{arxiv.2008.02173,
title = {Characterization and a 2D Visualization of B$_0$-VPG Cocomparability Graphs},
author = {Sreejith K. Pallathumadam and Deepak Rajendraprasad},
journal= {arXiv preprint arXiv:2008.02173},
year = {2020}
}
Comments
v1: Appears in the Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD 2020), v2: Changed order of authors and added ORCID, results unchanged