On clique-transversals and clique-independent sets
From MaRDI portal
(Redirected from Publication:1854773)
Recommendations
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
- Clique-perfectness of claw-free planar graphs
- Characterization and recognition of Helly circular-arc clique-perfect graphs
- Clique-perfectness of complements of line graphs
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
Cited in
(37)- Algorithmic aspects of clique-transversal and clique-independent sets
- On some graph classes related to perfect graphs: a survey
- Bounds on the clique-transversal number of regular graphs
- The \(\langle t \rangle \)-property of some classes of graphs
- Clique-transversal sets and clique-coloring in planar graphs
- Complete-subgraph-transversal-sets problem on bounded treewidth graphs
- Clique-perfectness of complements of line graphs
- The clique-transversal set problem in claw-free graphs with degree at most 4
- The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs
- Clique cycle transversals in graphs with few \(P_{4}\)'s
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
- Characterization and recognition of Helly circular-arc clique-perfect graphs
- Algorithms for clique-independent sets on subclasses of circular-arc graphs
- The algorithmic complexity of the minus clique-transversal problem
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
- Approximation algorithms for clique transversals on some graph classes
- Algorithms for finding clique-transversals of graphs
- Weighted maximum-clique transversal sets of graphs
- Clique-perfectness and balancedness of some graph classes
- Clique-perfectness of complements of line graphs
- Signed and minus clique-transversal functions on graphs
- Clique-Transversal Sets in Cubic Graphs
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
- Clique-transversal number of graphs whose clique-graphs are trees
- Distance-hereditary graphs are clique-perfect
- Hitting all maximal independent sets of a bipartite graph
- Approximability of clique transversal in perfect graphs
- On clique-perfect and K-perfect graphs
- Variations of maximum-clique transversal sets on graphs
- Clique-perfectness of claw-free planar graphs
- scientific article; zbMATH DE number 6612570 (Why is no real title available?)
- Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs
- Cycle transversals in perfect graphs and cographs
- Signed clique-transversal functions in graphs
- The clique-perfectness and clique-coloring of outer-planar graphs
- On the clique-transversal number of chordal graphs
This page was built for publication: On clique-transversals and clique-independent sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854773)
