scientific article; zbMATH DE number 3600081

MaRDI QIDQ4166786zbMATH OpenFDO

Authors Alon Itai, Michael Rodeh

Publication date 1978

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Combinatorial aspects of packing and covering (05B40) Paths and cycles (05C38) Graph theory (05C99)

Cited in

(39)

• Parity and disparity subgraphs
• Cycle covering in bridgeless graphs
• On shortest cocycle covers of graphs
• The multi-tree approach to reliability in distributed networks
• Integer flows and cycle covers
• A parallel algorithm for approximating the minimum cycle cover
• Triangle-free circuit decompositions and Petersen minor
• Extensions of flow theorems
• Covering a graph with cycles.
• Proofs of two minimum circuit cover conjectures
• Shortest circuit covers of signed graphs
• Short signed circuit covers of signed graphs
• Circuit decompositions and shortest circuit coverings of hypergraphs
• Randomised algorithms
• Routing problems: A bibliography
• Signed circuit cover of bridgeless signed graphs
• Cycle covers. III: Compatible circuit decomposition and \(K_5\)-transition minor
• Cycle double covers and non-separating cycles
• A bound on the total size of a cut cover
• A note about shortest cycle covers
• A cycle cover of a 2-edge-connected graph embedded with large face-width on an orientable surface
• Cycle covers. II: Circuit chain, Petersen chain and Hamilton weights.
• Circuit extension and circuit double cover of graphs
• Cycle double covers and the semi-Kotzig frame
• Graphs with the Circuit Cover Property
• Flows and parity subgraphs of graphs with large odd-edge-connectivity
• Optimal short cycle decomposition in almost linear time
• Cubic graphs with no short cycle covers
• Circuit double covers of graphs
• 5-Cycle Double Covers, 4-Flows, and Catlin Reduction
• Five-cycle double cover and shortest cycle cover
• Signed cycle double covers
• Cycle covers of cubic multigraphs
• Postman tours and cycle covers
• Non-separating cycles and 5-cycle double covers
• 4-coverable snarks, perfect matching cover, and Isaacs product
• An infinite family of snarks with perfect matching cover index 4
• A note on Alon-Tarsi shortest cycle cover conjecture
• Shortest coverings of graphs with cycles

This page was built for publication:

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