On shortest cocycle covers of graphs

DOI10.1016/0095-8956(85)90045-0zbMath0584.05051OpenAlexW2021160321MaRDI QIDQ1070245

Abdelkader Khelladi, Michel Mollard, François Jaeger

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)90045-0

zbMATH Keywords

cocycle cover

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

Covering complete hypergraphs with cuts of minimum total size ⋮ Short cycle covers and the cycle double cover conjecture ⋮ A bound on the total size of a cut cover ⋮ Covering Complete r-Graphs with Spanning Complete r-Partite r-Graphs ⋮ Lower bounds on the minimum average distance of binary codes

Cites Work

• Shortest coverings of graphs with cycles
• Nowhere zero flow and circuit covering in regular matroids
• Covering Graphs by Simple Circuits
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On shortest cocycle covers of graphs