Cycle covers of graphs with a nowhere-zero 4-flow

DOI10.1002/jgt.3190150608zbMath0747.05071OpenAlexW2029920486MaRDI QIDQ3984471

Andre Raspaud

Publication date: 27 June 1992

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190150608

zbMATH Keywords

flowssimple graphcycle covers

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (3)

A cycle cover of a 2-edge-connected graph embedded with large face-width on an orientable surface ⋮ Smallest (1, 2)‐eulerian weight and shortest cycle covering ⋮ A note about shortest cycle covers

Cites Work

• Integer flows and cycle covers
• Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4

This page was built for publication: Cycle covers of graphs with a nowhere-zero 4-flow