Covering weighted graphs by even subgraphs

DOI10.1016/0095-8956(90)90067-AzbMath0717.05066MaRDI QIDQ753842

Geng-Hua Fan

Publication date: 1990

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

bridgeless graphweighted graphedge cover

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Related Items

Minimum $T$-Joins and Signed-Circuit Covering ⋮ Relating edge-coverings to the classification of \(\mathbb Z^k_2\)-magic graphs ⋮ Integer flows and cycle covers ⋮ Integer 4-flows and cycle covers ⋮ Small snarks with large oddness ⋮ Graphs with the Circuit Cover Property

Cites Work

• Unnamed Item
• Shortest coverings of graphs with cycles
• Flows and generalized coloring theorems in graphs
• Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Covering Multigraphs by Simple Circuits
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: Covering weighted graphs by even subgraphs