On-line arbitrarily vertex decomposable trees (Q997067): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2007.02.011 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1996538461 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decomposable trees: A polynomial algorithm for tripodes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A degree bound on decomposable trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5481324 / rank | |||
Normal rank | |||
Latest revision as of 12:36, 26 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On-line arbitrarily vertex decomposable trees |
scientific article |
Statements
On-line arbitrarily vertex decomposable trees (English)
0 references
19 July 2007
0 references
arbitrarily vertex decomposable graphs
0 references
on-line
0 references
