Covering weighted graphs by even subgraphs
type: Item
instance of: scholarly article
title: Covering weighted graphs by even subgraphs
zbMATH Open document ID: 0717.05066
DOI: 10.1016/0095-8956(90)90067-A
published in: Journal of Combinatorial Theory. Series B
publication date: 1990-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 4181396
zbMATH Keywords: weighted graph
zbMATH Keywords: bridgeless graph
zbMATH Keywords: edge cover
author: Genghua Fan
MaRDI profile type: Publication
cites work: Covering Multigraphs by Simple Circuits
cites work: Shortest coverings of graphs with cycles
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
cites work: Flows and generalized coloring theorems in graphs
cites work: Edge-Disjoint Spanning Trees of Finite Graphs
cites work: Q3899969
cites work: On the Problem of Decomposing a Graph into n Connected Factors
description: scientific article; zbMATH DE number 4181396