On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs (Q5900085): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Clique Graph Recognition Is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some APX-completeness results for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The approximation of maximum subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Intersection Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4867717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407448 / rank
 
Normal rank

Latest revision as of 11:22, 28 June 2024

scientific article; zbMATH DE number 5284990
Language Label Description Also known as
English
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
scientific article; zbMATH DE number 5284990

    Statements