The \(k\)-in-a-tree problem for graphs of girth at least \(k\) (Q602681): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5421811 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The three-in-a-tree problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The four-in-a-tree problem in triangle-free graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3684121 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Detecting induced subgraphs / rank | |||
Normal rank | |||
Latest revision as of 09:55, 3 July 2024
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
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
