Computing the vertex separation of unicyclic graphs (Q596295): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ic.2004.03.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1973873776 / rank | |||
Normal rank | |||
Revision as of 20:40, 19 March 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
