Covering Multigraphs by Simple Circuits
From MaRDI portal
Publication:3703929
DOI10.1137/0606035zbMath0581.05046OpenAlexW2051565157MaRDI QIDQ3703929
Publication date: 1985
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0606035
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Shortest circuit covers of signed graphs, A cycle cover of a 2-edge-connected graph embedded with large face-width on an orientable surface, An overview of graph covering and partitioning, Characteristic flows on signed graphs and short circuit covers, A note on shortest cycle covers of cubic graphs, Extensions of flow theorems, Short cycle covers of cubic graphs, Smallest (1, 2)‐eulerian weight and shortest cycle covering, Circuit Covers of Signed Graphs, Shipper collaboration, On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings, Circuit \(k\)-covers of signed graphs, A note on shortest sign-circuit cover of signed 3-edge-colorable cubic graphs, Short signed circuit covers of signed graphs, Minimum $T$-Joins and Signed-Circuit Covering, Some snarks are worse than others, Covering a graph with cycles., Short cycle covers of graphs with at most 77\% vertices of degree two, Generation and properties of snarks, Signed circuit cover of bridgeless signed graphs, Signed cycle double covers, Integer flows and cycle covers, Integer 4-flows and cycle covers, Circuit decompositions and shortest circuit coverings of hypergraphs, Cubic Graphs with No Short Cycle Covers, Short cycle covers and the cycle double cover conjecture, 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, Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits, Covering weighted graphs by even subgraphs, 1‐Factor and Cycle Covers of Cubic Graphs, Circuit Covers of Signed Eulerian Graphs, Short Cycle Covers on Cubic Graphs by Choosing a 2-Factor, Proofs of two minimum circuit cover conjectures, Short cycle covers of graphs and nowhere-zero flows, Towards obtaining a 3-decomposition from a perfect matching, A note about shortest cycle covers, Nowhere zero flow and circuit covering in regular matroids
Cites Work
