Covering weighted graphs by even subgraphs (Q753842)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4181396
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Covering weighted graphs by even subgraphs |
scientific article; zbMATH DE number 4181396 |
Statements
Covering weighted graphs by even subgraphs (English)
0 references
1990
0 references
Main result: Every bridgeless graph G with weighted edges has an edge cover by four subgraphs with even vertex-degrees such that every edge is contained exactly in two, or exactly in four of them and the total weight of them is at most 20/9 of the weight of G. Several corollaries for unweighted graphs are given.
0 references
weighted graph
0 references
bridgeless graph
0 references
edge cover
0 references
0.8423428535461426
0 references
0.8215063214302063
0 references
0.8188826441764832
0 references
0.8118405938148499
0 references
