On the complexity of recognizing perfectly orderable graphs
From MaRDI portal
(Redirected from Publication:918707)
Recommendations
Cites work
Cited in
(41)- Some classes of perfectly orderable graphs
- Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam
- Linear time algorithms for NP-hard problems restricted to \textsc{GaTEx} graphs
- A charming class of perfectly orderable graphs
- A characterization of \(P_{4}\)-comparability graphs
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
- On opposition graphs, coalition graphs, and bipartite permutation graphs
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
- Characterization and recognition of some opposition and coalition graph classes
- Finding houses and holes in graphs
- On the \(P_4\)-components of graphs
- The computational complexity of the edge-perfect graph and the totally balanced packing game recognition problems
- Ordering without forbidden patterns
- On the computational complexity of ordered subgraph recognition
- scientific article; zbMATH DE number 47434 (Why is no real title available?)
- New properties of perfectly orderable graphs and strongly perfect graphs
- scientific article; zbMATH DE number 6770058 (Why is no real title available?)
- The parallel complexity of elimination ordering procedures
- The recognition of triangle graphs
- scientific article; zbMATH DE number 811561 (Why is no real title available?)
- Recognizing Bellman–Ford-Orderable Graphs
- Coloring Artemis graphs
- Which claw-free graphs are perfectly orderable?
- Four classes of perfectly orderable graphs
- Recognizing quasi-triangulated graphs.
- On the complexity of recognizing a class of perfectly orderable graphs
- An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs
- Meyniel weakly triangulated graphs. I: Co-perfect orderability
- A characterization of \(b\)-perfect graphs
- A polynomial algorithm for the parity path problem on perfectly orientable graphs
- Quasi-brittle graphs, a new class of perfectly orderable graphs
- A class of perfectly contractile graphs
- Properly orderable graphs
- Recognition of some perfectly orderable graph classes
- An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs
- Classes of perfect graphs
- Coloration de graphes : fondements et applications
- \(P_{4}\)-laden graphs: A new class of brittle graphs
- Recognizing \(k\)-clique extendible orderings
- Path parity and perfection
- A note on perfectly orderable graphs
This page was built for publication: On the complexity of recognizing perfectly orderable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q918707)
