Abstract
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs are distance hereditary. Utilizing this property, we give a linear time recognition algorithm. We then characterize permutation graphs that are treelike. Finally, we consider the PARTITIONING INTO BOUNDED CLIQUES problem on special subgraphs of treelike permutation graphs. © Springer-Verlag 2004.
Cite
CITATION STYLE
Cornelsen, S., & Di Stefano, G. (2004). Treelike comparability graphs: Characterization, recognition, and applications. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3353, 46–57. https://doi.org/10.1007/978-3-540-30559-0_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
