Detecting induced subgraphs (Q5900072): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.endm.2007.07.036 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/j.dam.2009.02.015 / rank
Normal rank
 
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
Property / DOI
 
Property / DOI: 10.1016/J.ENDM.2007.07.036 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2009.02.015 / rank
 
Normal rank

Latest revision as of 02:48, 28 December 2024

scientific article; zbMATH DE number 5702668
Language Label Description Also known as
English
Detecting induced subgraphs
scientific article; zbMATH DE number 5702668

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references