Detecting induced subgraphs (Q5900072): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the complexity of testing for odd holes and induced odd paths / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A structure theorem for graphs with no cycle with a unique chord and its consequences / rank | |||
Normal rank | |||
Latest revision as of 18:28, 2 July 2024
scientific article; zbMATH DE number 5702668
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Detecting induced subgraphs |
scientific article; zbMATH DE number 5702668 |
Statements
Detecting induced subgraphs (English)
0 references
5 June 2008
0 references
28 April 2010
0 references
detecting
0 references
induced
0 references
subgraphs
0 references
