Pages that link to "Item:Q1811119"

The following pages link to Recognition of some perfectly orderable graph classes (Q1811119):

Displaying 3 items.

• Characterization and recognition of some opposition and coalition graph classes (Q344867) (← links)
• An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs (Q714793) (← links)
• On opposition graphs, coalition graphs, and bipartite permutation graphs (Q2442203) (← links)