Discrete Applied Mathematics - Computational combinatiorics
A linear time algorithm to compute a dominating path in an AT-free graph
Information Processing Letters
SIAM Journal on Discrete Mathematics
Graph classes: a survey
Introduction to Algorithms
On the Complexity of Scheduling Incompatible Jobs with Unit-Times
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Efficient Parallel and Linear Time Sequential Split Decomposition (Extended Abstract)
Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
On Complexity of Some Chain and Antichain Partition Problems
WG '91 Proceedings of the 17th International Workshop
The Vertex-Disjoint Triangles Problem
WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
On the completeness of a generalized matching problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Journal of Discrete Algorithms
Treelike comparability graphs: characterization, recognition, and applications
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Distance-hereditary comparability graphs
Discrete Applied Mathematics
| Hi-index | 0.04 |
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.