Computing the vertex separation of unicyclic graphs (Q596295): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:49, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the vertex separation of unicyclic graphs |
scientific article |
Statements
Computing the vertex separation of unicyclic graphs (English)
0 references
10 August 2004
0 references
Algorithms
0 references
Unicyclic graphs
0 references
Trees
0 references
Vertex separation
0 references
Search number
0 references
Pathwidth
0 references
Linear layouts
0 references
Layout extensibility
0 references
