The following pages link to (Q4373681):
Displaying 12 items.
- Construction of a simple elimination scheme for a chordal comparability graph in linear time (Q1283807) (← links)
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs (Q1962062) (← links)
- Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
- The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond (Q2235279) (← links)
- Perfect circular arc coloring (Q2569164) (← links)
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073) (← links)
- A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (Q4561265) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- (Q5090996) (← links)
- (Q5091021) (← links)
- (Q5091230) (← links)
- The Perfect Matching Reconfiguration Problem (Q5092444) (← links)