A simple certifying algorithm for 3-edge-connectivity (Q2689444)
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: A simple certifying algorithm for 3-edge-connectivity |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple certifying algorithm for 3-edge-connectivity |
scientific article |
Statements
A simple certifying algorithm for 3-edge-connectivity (English)
0 references
10 March 2023
0 references
certifying algorithm
0 references
graph recognition algorithm
0 references
3-edge-connected graph
0 references
3-edge-connected component
0 references
Mader construction sequence
0 references
cactus representation of cut-pair
0 references
certificate
0 references
depth-first search
0 references
