Upper Clique Transversals in Graphs
From MaRDI portal
Publication:6496557
Cites work
- scientific article; zbMATH DE number 3648727 (Why is no real title available?)
- scientific article; zbMATH DE number 3871413 (Why is no real title available?)
- scientific article; zbMATH DE number 3691392 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- (In)approximability of maximum minimal FVS
- A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
- Algorithmic Aspects of Neighborhood Numbers
- Algorithmic aspects of clique-transversal and clique-independent sets
- Algorithmic aspects of upper edge domination
- Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment
- Approximation algorithms for clique transversals on some graph classes
- Biconvex graphs: Ordering and algorithms
- Bipartite permutation graphs
- Chordal graphs and upper irredundance, upper domination and independence
- Clique-perfectness of complements of line graphs
- Clique-transversal sets and clique-coloring in planar graphs
- Clique-transversal sets of line graphs and complements of line graphs
- Complete-subgraph-transversal-sets problem on bounded treewidth graphs
- Covering the cliques of a graph with vertices
- Distance-hereditary graphs are clique-perfect
- Dominating sets for split and bipartite graphs
- Domination in convex and chordal bipartite graphs
- Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs
- Graph Classes: A Survey
- Induced matchings in asteroidal triple-free graphs
- Maximum minimal vertex cover parameterized by vertex cover
- On covering all cliques of a chordal graph
- On the max min vertex cover problem
- Optimal‐size clique transversals in chordal graphs
- Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover
- Star forests, dominating sets and Ramsey-type problems
- Strong cliques and stable sets
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- The Roberts characterization of proper and unit interval graphs
- The many facets of upper domination
- Upper domination: towards a dichotomy through boundary properties
- Weighted upper edge cover: complexity and approximability
This page was built for publication: Upper Clique Transversals in Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496557)
