The following pages link to Weak bipolarizable graphs (Q1116961):
Displaying 12 items.
- An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs (Q714793) (← links)
- A fast parallel algorithm to recognize partitionable graphs (Q917295) (← links)
- Some aspects of the semi-perfect elimination (Q1175796) (← links)
- The maximum clique problem (Q1318271) (← links)
- Duchet-type theorems for powers of HHD-free graphs (Q1377865) (← links)
- Finding a central vertex in an HHD-free graph (Q1408816) (← links)
- Distance labeling scheme and split decomposition (Q1417571) (← links)
- Recognition of some perfectly orderable graph classes (Q1811119) (← links)
- Extension of hereditary classes with substitutions (Q1811128) (← links)
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs (Q1897361) (← links)
- Convex geometries over induced paths with bounded length (Q2092354) (← links)
- Computing the hull and interval numbers in the weakly toll convexity (Q6131192) (← links)