The following pages link to (Q3128916):
Displaying 21 items.
- A cubic-vertex kernel for flip consensus tree (Q2441594) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073) (← links)
- On structural parameterizations of Node Kayles (Q2695476) (← links)
- Linear-time algorithms for maximum sets of sources and sinks (Q2741377) (← links)
- A characterization of \(b\)-perfect graphs (Q2911056) (← links)
- A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (Q4561265) (← links)
- A tight lower bound for primitivity in k-structures (Q4632456) (← links)
- Odd Holes in Bull-Free Graphs (Q4638616) (← links)
- Efficient and Adaptive Parameterized Algorithms on Modular Decompositions (Q5009620) (← links)
- An Analytic Propositional Proof System on Graphs (Q5060181) (← links)
- Cograph editing: Merging modules is equivalent to editing P_4s (Q5121555) (← links)
- Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508) (← links)
- Finding houses and holes in graphs (Q5941278) (← links)
- Nesting of prime substructures in \(k-\)ary relations (Q5941284) (← links)
- On the hull number on cycle convexity of graphs (Q6072203) (← links)
- Computing the hull and interval numbers in the weakly toll convexity (Q6131192) (← links)
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs (Q6180640) (← links)
- Weighted domination on cocomparability graphs (Q6487953) (← links)
- A new characterization of \(P_4\)-connected graphs (Q6550529) (← links)
- Homogeneous sets and domination problems (Q6550554) (← links)
