Pages that link to "Item:Q1917287"
From MaRDI portal
The following pages link to Algorithmic aspects of the generalized clique-transversal problem on chordal graphs (Q1917287):
Displaying 18 items.
- A linear-time algorithm for the weighted feedback vertex problem on interval graphs (Q286981) (← links)
- The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs (Q344543) (← links)
- Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
- The clique-transversal set problem in claw-free graphs with degree at most 4 (Q477680) (← links)
- Algorithms for finding clique-transversals of graphs (Q940841) (← links)
- Variations of \(Y\)-dominating functions on graphs (Q941347) (← links)
- Bounds on the clique-transversal number of regular graphs (Q943436) (← links)
- Signed and minus clique-transversal functions on graphs (Q976135) (← links)
- Algorithmic aspects of clique-transversal and clique-independent sets (Q1971220) (← links)
- Labelled packing functions in graphs (Q2011027) (← links)
- Complete-subgraph-transversal-sets problem on bounded treewidth graphs (Q2045031) (← links)
- The geodesic-transversal problem (Q2246468) (← links)
- The algorithmic complexity of the minus clique-transversal problem (Q2383654) (← links)
- Variations of maximum-clique transversal sets on graphs (Q2430591) (← links)
- Distance-hereditary graphs are clique-perfect (Q2489948) (← links)
- Signed clique-transversal functions in graphs (Q3056375) (← links)
- Approximation results for the optimum cost chromatic partition problem (Q4572001) (← links)
- Clique-transversal number of graphs whose clique-graphs are trees (Q5320228) (← links)
