On \(( s , t )\)-supereulerian graphs with linear degree bounds (Q2222943)
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: On ( s , t )-supereulerian graphs with linear degree bounds |
scientific article; zbMATH DE number 7302666
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On \(( s , t )\)-supereulerian graphs with linear degree bounds |
scientific article; zbMATH DE number 7302666 |
Statements
On \(( s , t )\)-supereulerian graphs with linear degree bounds (English)
0 references
27 January 2021
0 references
edge-connectivity
0 references
closed trails
0 references
supereulerian graphs
0 references
\( ( s
0 references
t )\)-supereulerian
0 references
collapsible graphs
0 references
reduction
0 references
0.9432862401008606
0 references
0.9014240503311156
0 references
0.8700380325317383
0 references
0.8485467433929443
0 references
0.8465851545333862
0 references
