scientific article; zbMATH DE number 3600081
From MaRDI portal
Publication:4166786
zbMath0386.05047MaRDI QIDQ4166786
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paths and cycles (05C38) Graph theory (05C99) Combinatorial aspects of packing and covering (05B40) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (34)
5-Cycle Double Covers, 4-Flows, and Catlin Reduction ⋮ Cycle covers. II: Circuit chain, Petersen chain and Hamilton weights. ⋮ Shortest circuit covers of signed graphs ⋮ A cycle cover of a 2-edge-connected graph embedded with large face-width on an orientable surface ⋮ Extensions of flow theorems ⋮ The multi-tree approach to reliability in distributed networks ⋮ Routing problems: A bibliography ⋮ Circuit extension and circuit double cover of graphs ⋮ Short signed circuit covers of signed graphs ⋮ Cycle double covers and the semi-Kotzig frame ⋮ Covering a graph with cycles. ⋮ Flows and parity subgraphs of graphs with large odd-edge-connectivity ⋮ Signed circuit cover of bridgeless signed graphs ⋮ Signed cycle double covers ⋮ Integer flows and cycle covers ⋮ Circuit decompositions and shortest circuit coverings of hypergraphs ⋮ Cubic Graphs with No Short Cycle Covers ⋮ Cycle covers of cubic multigraphs ⋮ Postman tours and cycle covers ⋮ A parallel algorithm for approximating the minimum cycle cover ⋮ A bound on the total size of a cut cover ⋮ Graphs with the Circuit Cover Property ⋮ Unnamed Item ⋮ Triangle-free circuit decompositions and Petersen minor ⋮ Parity and disparity subgraphs ⋮ Cycle covers. III: Compatible circuit decomposition and \(K_5\)-transition minor ⋮ Proofs of two minimum circuit cover conjectures ⋮ Cycle double covers and non-separating cycles ⋮ Randomised algorithms ⋮ Circuit Double Covers of Graphs ⋮ A note about shortest cycle covers ⋮ Shortest coverings of graphs with cycles ⋮ Cycle covering in bridgeless graphs ⋮ On shortest cocycle covers of graphs
This page was built for publication:
