On maximum independent sets in \(P_{5}\)-free graphs (Q708334): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Complete description of forbidden subgraphs in the structural domination problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dominating cliques in \(P_ 5\)-free graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Measure and conquer / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A New Characterization of P 6-Free Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4414647 / rank | |||
Normal rank |
Latest revision as of 08:13, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On maximum independent sets in \(P_{5}\)-free graphs |
scientific article |
Statements
On maximum independent sets in \(P_{5}\)-free graphs (English)
0 references
11 October 2010
0 references
independent set
0 references
independence number
0 references
subexponential algorithms
0 references