Cycle covering in bridgeless graphs

DOI10.1016/0095-8956(85)90044-9zbMath0583.05035OpenAlexW2086333030MaRDI QIDQ1069955

Pierre Fraisse

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0095-8956(85)90044-9

zbMATH Keywords

bridgeless graphweight of an edgeweighted edgescycle cover of a graphvertex cover with cycles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (10)

An overview of graph covering and partitioning ⋮ Extensions of flow theorems ⋮ Smallest (1, 2)‐eulerian weight and shortest cycle covering ⋮ Shipper collaboration ⋮ Covering a graph with cycles. ⋮ Integer flows and cycle covers ⋮ Postman tours and cycle covers ⋮ A bound on the total size of a cut cover ⋮ Proofs of two minimum circuit cover conjectures ⋮ A note about shortest cycle covers

Cites Work

• Shortest coverings of graphs with cycles
• Lectures on matroids
• On Minimal Blocks
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cycle covering in bridgeless graphs