Algorithms for \(P_4\)-comparability graph recognition and acyclic \(P_4\)-transitive orientation

DOI10.1007/s00453-003-1075-9zbMath1064.68073OpenAlexW2076619703MaRDI QIDQ1882629

Stavros D. Nikolopoulos, Leonidas Palios

Publication date: 1 October 2004

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-003-1075-9

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

A characterization of \(P_{4}\)-comparability graphs ⋮ An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs

This page was built for publication: Algorithms for \(P_4\)-comparability graph recognition and acyclic \(P_4\)-transitive orientation