On the complexity of recognizing perfectly orderable graphs
From MaRDI portal
Publication:918707
DOI10.1016/0012-365X(90)90251-CzbMath0706.68058MaRDI QIDQ918707
Frank Pfeiffer, Matthias Middendorf
Publication date: 1990
Published in: Discrete Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)
Related Items (30)
Quasi-brittle graphs, a new class of perfectly orderable graphs ⋮ Efficient algorithms for minimum weighted colouring of some classes of perfect graphs ⋮ An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs ⋮ \(P_{4}\)-laden graphs: A new class of brittle graphs ⋮ Coloration de graphes : fondements et applications ⋮ A Characterization of b-Perfect Graphs ⋮ Path parity and perfection ⋮ Characterization and recognition of some opposition and coalition graph classes ⋮ A polynomial algorithm for the parity path problem on perfectly orientable graphs ⋮ A note on perfectly orderable graphs ⋮ On the complexity of recognizing a class of perfectly orderable graphs ⋮ On the computational complexity of ordered subgraph recognition ⋮ The parallel complexity of elimination ordering procedures ⋮ A characterization of \(P_{4}\)-comparability graphs ⋮ Classes of perfect graphs ⋮ The recognition of triangle graphs ⋮ On opposition graphs, coalition graphs, and bipartite permutation graphs ⋮ Recognizing quasi-triangulated graphs. ⋮ On the \(P_4\)-components of graphs ⋮ New properties of perfectly orderable graphs and strongly perfect graphs ⋮ Meyniel weakly triangulated graphs. I: Co-perfect orderability ⋮ A charming class of perfectly orderable graphs ⋮ Which claw-free graphs are perfectly orderable? ⋮ Finding houses and holes in graphs ⋮ An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs ⋮ On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs ⋮ Recognition of some perfectly orderable graph classes ⋮ Coloring Artemis graphs ⋮ Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam ⋮ A class of perfectly contractile graphs
Cites Work
This page was built for publication: On the complexity of recognizing perfectly orderable graphs
