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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-60618-1_62 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1545226987 / 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: Q5572939 / 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: Q5781249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring perfect \((K_ 4\)-e)-free graphs / rank
 
Normal rank

Latest revision as of 14:10, 27 August 2024

scientific article; zbMATH DE number 7810353
Language Label Description Also known as
English
Finding and counting small induced subgraphs efficiently
scientific article; zbMATH DE number 7810353

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references