Pages that link to "Item:Q918707"

The following pages link to On the complexity of recognizing perfectly orderable graphs (Q918707):

Displaying 38 items.

• Characterization and recognition of some opposition and coalition graph classes (Q344867) (← links)
• The recognition of triangle graphs (Q441856) (← links)
• Meyniel weakly triangulated graphs. I: Co-perfect orderability (Q678852) (← links)
• Which claw-free graphs are perfectly orderable? (Q686245) (← links)
• An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs (Q714793) (← links)
• On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs (Q995559) (← links)
• Coloring Artemis graphs (Q1019741) (← links)
• New properties of perfectly orderable graphs and strongly perfect graphs (Q1185094) (← links)
• A charming class of perfectly orderable graphs (Q1193431) (← links)
• Efficient algorithms for minimum weighted colouring of some classes of perfect graphs (Q1339397) (← links)
• \(P_{4}\)-laden graphs: A new class of brittle graphs (Q1349998) (← links)
• Path parity and perfection (Q1356748) (← links)
• Recognizing quasi-triangulated graphs. (Q1428566) (← links)
• Recognition of some perfectly orderable graph classes (Q1811119) (← links)
• Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam (Q1814095) (← links)
• Properly orderable graphs (Q1815322) (← links)
• A polynomial algorithm for the parity path problem on perfectly orientable graphs (Q1917257) (← links)
• A note on perfectly orderable graphs (Q1917281) (← links)
• On the complexity of recognizing a class of perfectly orderable graphs (Q1917290) (← links)
• On the \(P_4\)-components of graphs (Q1971221) (← links)
• Quasi-brittle graphs, a new class of perfectly orderable graphs (Q2366016) (← links)
• An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs (Q2373437) (← links)
• On the approximability of digraph ordering (Q2408167) (← links)
• A characterization of \(P_{4}\)-comparability graphs (Q2433707) (← links)
• Classes of perfect graphs (Q2433714) (← links)
• On opposition graphs, coalition graphs, and bipartite permutation graphs (Q2442203) (← links)
• A class of perfectly contractile graphs (Q2581496) (← links)
• The computational complexity of the edge-perfect graph and the totally balanced packing game recognition problems (Q2883612) (← links)
• A characterization of \(b\)-perfect graphs (Q2911056) (← links)
• Four classes of perfectly orderable graphs (Q3800062) (← links)
• Some classes of perfectly orderable graphs (Q3831058) (← links)
• Recognizing Bellman–Ford-Orderable Graphs (Q3832062) (← links)
• Coloration de graphes : fondements et applications (Q4809665) (← links)
• On the computational complexity of ordered subgraph recognition (Q4851929) (← links)
• (Q5354995) (← links)
• Recognizing \(k\)-clique extendible orderings (Q5925536) (← links)
• Finding houses and holes in graphs (Q5941278) (← links)
• Linear time algorithms for NP-hard problems restricted to \textsc{GaTEx} graphs (Q6591462) (← links)