Algorithms for finding clique-transversals of graphs
From MaRDI portal
(Redirected from Publication:940841)
Recommendations
- Algorithmic aspects of clique-transversal and clique-independent sets
- Algorithms for clique-independent sets on subclasses of circular-arc graphs
- Characterization and recognition of Helly circular-arc clique-perfect graphs
- scientific article; zbMATH DE number 2044919
- Approximation algorithms for clique transversals on some graph classes
Cites work
- scientific article; zbMATH DE number 3691392 (Why is no real title available?)
- Algorithmic Aspects of Neighborhood Numbers
- Algorithmic aspects of clique-transversal and clique-independent sets
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
- Algorithms for clique-independent sets on subclasses of circular-arc graphs
- Algorithms on circular-arc graphs
- Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
- Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
- Covering all cliques of a graph
- Covering the cliques of a graph with vertices
- Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
- Linear time algorithms on circular-arc graphs
- Linear-time recognition of Helly circular-arc models and graphs
- Maximum \(h\)-colourable subgraph problem in balanced graphs
- On balanced graphs
- On clique-transversals and clique-independent sets
Cited in
(22)- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- Algorithmic aspects of clique-transversal and clique-independent sets
- Computing and Combinatorics
- LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs
- On some graph classes related to perfect graphs: a survey
- 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
- Faster Algorithms to Enumerate Hypergraph Transversals
- Characterization and recognition of Helly circular-arc clique-perfect graphs
- The algorithmic complexity of the minus clique-transversal problem
- Inapproximability of \(H\)-transversal/packing
- The \((a, b)\)-monochromatic transversal game on clique-hypergraphs of powers of cycles
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- Approximation algorithms for clique transversals on some graph classes
- scientific article; zbMATH DE number 7564191 (Why is no real title available?)
- Weighted maximum-clique transversal sets of graphs
- Clique-perfectness and balancedness of some graph classes
- Clique-perfectness of complements of line graphs
- Hitting all maximal independent sets of a bipartite graph
- Optimal‐size clique transversals in chordal graphs
- Variations of maximum-clique transversal sets on graphs
- Computing subset transversals in \(H\)-free graphs
This page was built for publication: Algorithms for finding clique-transversals of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q940841)
