scientific article; zbMATH DE number 2044919
From MaRDI portal
Publication:4448744
Recommendations
- Variations of maximum-clique transversal sets on graphs
- The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs
- Weighted maximum-clique transversal sets of graphs
- The clique-transversal set problem in claw-free graphs with degree at most 4
- Clique-transversal sets and weak 2-colorings in graphs of small maximum degree
Cited in
(16)- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
- Algorithmic aspects of clique-transversal and clique-independent sets
- Approximation algorithms for clique transversals on some graph classes
- Variations of maximum-clique transversal sets on graphs
- Distance-hereditary graphs are clique-perfect
- The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs
- Clique-transversal sets and weak 2-colorings in graphs of small maximum degree
- Weighted maximum-clique transversal sets of graphs
- Optimal‐size clique transversals in chordal graphs
- The signed maximum-clique transversal number of regular graphs
- Inapproximability of \(H\)-transversal/packing
- On blockers and transversals of maximum independent sets in co-comparability graphs
- Algorithms for finding clique-transversals of graphs
- Linearity of grid minors in treewidth with applications through bidimensionality
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4448744)
