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

DOI10.1002/JGT.3190150608zbMATH Open0747.05071OpenAlexW2029920486MaRDI QIDQ3984471FDOQ3984471

Authors: André 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

Recommendations

• Minimum cycle coverings and integer flows
• Short cycle covers of graphs and nowhere-zero flows
• Integer flows and cycle covers
• Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4

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)

Cites Work

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

Cited In (10)

• Covering Multigraphs by Simple Circuits
• A note about shortest cycle covers
• Integer 4-flows and cycle covers
• 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
• Short cycle covers of graphs and nowhere-zero flows
• Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4
• Note on integer 4-flows in graphs
• Cycle and cocycle coverings of graphs
• On shortest cocycle covers of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3984471)