The \(k\)-in-a-tree problem for graphs of girth at least \(k\) (Q602681)

From MaRDI portal
Revision as of 00:43, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
The \(k\)-in-a-tree problem for graphs of girth at least \(k\)
scientific article

    Statements

    The \(k\)-in-a-tree problem for graphs of girth at least \(k\) (English)
    0 references
    0 references
    5 November 2010
    0 references
    tree
    0 references
    algorithm
    0 references
    three-in-a-tree
    0 references
    \(k\)-in-a-tree
    0 references
    girth
    0 references
    induced subgraph
    0 references

    Identifiers