A charcterization of 4‐edge‐connected eulerian graphs (Q4843510)
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 charcterization of 4‐edge‐connected eulerian graphs |
scientific article; zbMATH DE number 784578
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A charcterization of 4‐edge‐connected eulerian graphs |
scientific article; zbMATH DE number 784578 |
Statements
A charcterization of 4‐edge‐connected eulerian graphs (English)
0 references
7 January 1996
0 references
characterization
0 references
spanning trees
0 references
eulerian graph
0 references
cycle decomposition
0 references
0.8429991006851196
0 references
0.8066384196281433
0 references
0.7925741672515869
0 references
0.7919023036956787
0 references
