Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge (Q4908826)
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: Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge |
scientific article; zbMATH DE number 6142487
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge |
scientific article; zbMATH DE number 6142487 |
Statements
Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge (English)
0 references
7 March 2013
0 references
edges
0 references
3-connected graph
0 references
spanning tree
0 references
DFS-tree
0 references
0.8784429
0 references
0.8741047
0 references
0.8682277
0 references
0.8635066
0 references
0.8575083
0 references
0.84936005
0 references
0.84853745
0 references
