On the complexity of recognizing a class of perfectly orderable graphs

DOI10.1016/0166-218X(94)00162-7zbMath0854.68044OpenAlexW1968248322MaRDI QIDQ1917290

Chính T. Hoàng

Publication date: 7 July 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(94)00162-7

zbMATH Keywords

perfectly orderable graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Related Items (5)

Characterization and recognition of some opposition and coalition graph classes ⋮ On opposition graphs, coalition graphs, and bipartite permutation graphs ⋮ Meyniel weakly triangulated graphs. I: Co-perfect orderability ⋮ An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs ⋮ Bichromatic \(P_{4}\)-composition schemes for perfect orderability

Cites Work

• Unnamed Item
• Weakly triangulated graphs
• On the complexity of recognizing perfectly orderable graphs
• \(P_ 4\)-comparability graphs
• Some classes of perfectly orderable graphs
• The complexity of satisfiability problems

This page was built for publication: On the complexity of recognizing a class of perfectly orderable graphs