Finding and counting small induced subgraphs efficiently (Q294749): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Finding and counting given length cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arboricity and Subgraph Listing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs---a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Minimum Circuit in a Graph / 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: Q3688439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring perfect \((K_ 4\)-e)-free graphs / rank
 
Normal rank

Revision as of 04:49, 12 July 2024

scientific article
Language Label Description Also known as
English
Finding and counting small induced subgraphs efficiently
scientific article

    Statements

    Finding and counting small induced subgraphs efficiently (English)
    0 references
    0 references
    0 references
    0 references
    16 June 2016
    0 references
    graph algorithms
    0 references
    simplicial vertex
    0 references
    claw-free graph
    0 references
    diamond-free graph
    0 references

    Identifiers