Upper Clique Transversals in Graphs (Q6496557): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Biconvex graphs: Ordering and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper domination: towards a dichotomy through boundary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: On covering all cliques of a chordal graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-transversal sets of line graphs and complements of line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The many facets of upper domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets for split and bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3206969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-perfectness of complements of line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the max min vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Neighborhood Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings in asteroidal triple-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal‐size clique transversals in chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in convex and chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: (In)approximability of maximum minimal FVS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering the cliques of a graph with vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star forests, dominating sets and Ramsey-type problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Roberts characterization of proper and unit interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of clique-transversal and clique-independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3338291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal graphs and upper irredundance, upper domination and independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted Upper Edge Cover: Complexity and Approximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-hereditary graphs are clique-perfect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for clique transversals on some graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete-subgraph-transversal-sets problem on bounded treewidth graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong cliques and stable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of upper edge domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3885799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-transversal sets and clique-coloring in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Minimal Vertex Cover Parameterized by Vertex Cover / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:59, 3 December 2024

scientific article; zbMATH DE number 7842229
Language Label Description Also known as
English
Upper Clique Transversals in Graphs
scientific article; zbMATH DE number 7842229

    Statements

    Upper Clique Transversals in Graphs (English)
    0 references
    0 references
    0 references
    3 May 2024
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers