Determining the number of internal stability of a graph (Q3960887): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5635469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the Stability Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-blocking polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covers and packings in a family of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum internally stable sets of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of set packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the integer-valued variables in the linear vertex packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum node covers and 2-bicritical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Independent Set / rank
 
Normal rank

Latest revision as of 17:03, 13 June 2024

scientific article
Language Label Description Also known as
English
Determining the number of internal stability of a graph
scientific article

    Statements

    Identifiers