The following pages link to (Q4944973):
Displaying 14 items.
- New plain-exponential time classes for graph homomorphism (Q639844) (← links)
- Collective tree spanners in graphs with bounded parameters (Q848633) (← links)
- Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs (Q1653049) (← links)
- Computing the clique-width of cactus graphs (Q1744436) (← links)
- Labelled packing functions in graphs (Q2011027) (← links)
- Computing a metric basis of a bipartite distance-hereditary graph (Q2062127) (← links)
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width (Q2311126) (← links)
- Computing maximum stable sets for distance-hereditary graphs (Q2568337) (← links)
- On the complexity of the labeled domination problem in graphs (Q2968509) (← links)
- Graph Classes with Structured Neighborhoods and Algorithmic Applications (Q3104764) (← links)
- The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs (Q3181049) (← links)
- Twin-distance-hereditary digraphs (Q6132965) (← links)
- Stability, vertex stability, and unfrozenness for special graph classes (Q6151148) (← links)
- On \(d\)-stable locally checkable problems parameterized by mim-width (Q6202932) (← links)
