Pages that link to "Item:Q1262127"
From MaRDI portal
The following pages link to The complexity of generalized clique covering (Q1262127):
Displaying 23 items.
- A linear-time algorithm for the weighted feedback vertex problem on interval graphs (Q286981) (← links)
- Maximum \(h\)-colourable subgraph problem in balanced graphs (Q293269) (← links)
- Enumerating minimal subset feedback vertex sets (Q472481) (← links)
- Generalized vertex covering in interval graphs (Q1199467) (← links)
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs (Q1917287) (← links)
- Algorithmic aspects of clique-transversal and clique-independent sets (Q1971220) (← links)
- Structural parameterizations with modulator oblivion (Q2161010) (← links)
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q2169982) (← links)
- On strictly chordality-\(k\) graphs (Q2181248) (← links)
- The geodesic-transversal problem (Q2246468) (← links)
- Subset feedback vertex set on graphs of bounded independent set size (Q2304562) (← links)
- Faster exact algorithms for some terminal set problems (Q2361353) (← links)
- New upper bounds on feedback vertex numbers in butterflies (Q2390267) (← links)
- Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
- Subset feedback vertex sets in chordal graphs (Q2447531) (← links)
- The maximum vertex coverage problem on bipartite graphs (Q2448919) (← links)
- Reconfiguration of colorable sets in classes of perfect graphs (Q2632018) (← links)
- Parameterized and exact algorithms for class domination coloring (Q2659082) (← links)
- Parameterized and Exact Algorithms for Class Domination Coloring (Q2971145) (← links)
- (Q5009483) (← links)
- (Q6089666) (← links)
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q6119835) (← links)
- Constrained Hitting Set and Steiner Tree in SCk and 2K2-free Graphs (Q6136471) (← links)
