Computing the vertex separation of unicyclic graphs (Q596295)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing the vertex separation of unicyclic graphs |
scientific article; zbMATH DE number 2085624
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the vertex separation of unicyclic graphs |
scientific article; zbMATH DE number 2085624 |
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
0.8292580842971802
0 references
0.7932023406028748
0 references
0.7640862464904785
0 references
