The following pages link to Weak bipolarizable graphs (Q1116961):
Displaying 23 items.
- An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs (Q714793) (← links)
- Bipolarizable graphs (Q912868) (← 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)
- Quasi-brittle graphs, a new class of perfectly orderable graphs (Q2366016) (← links)
- Oracles for vertex elimination orderings (Q2566003) (← links)
- A New Class of Brittle Graphs (Q3478443) (← links)
- (Q3809836) (← links)
- Weakly pancyclic graphs (Q4241731) (← links)
- Lexbfs-orderings and powers of hhd-free graphs<sup>∗</sup> (Q4254590) (← links)
- Powers of hhd-free graphs<sup>∗</sup> (Q4256126) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- Computing the hull and interval numbers in the weakly toll convexity (Q6131192) (← links)
- LexBFS-orderings and powers of graphs (Q6550543) (← links)
- Characterizations of graph classes via convex geometries: a survey (Q6648266) (← links)
