Detecting induced subgraphs (Q5900072): Difference between revisions

From MaRDI portal
Merged Item from Q5900861
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by the same user not shown)
Property / cites work
 
Property / cites work: Finding and counting given length cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrigendum to: On the complexity of testing for odd holes and induced odd paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The three-in-a-tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5717953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Perfectly Contractile Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Square-3PC($\cdot, \cdot$)-Free Berge Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / 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

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

    Identifiers

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