Covering Graphs by Simple Circuits
From MaRDI portal
Publication:3922184
DOI10.1137/0210058zbMath0468.68071OpenAlexW2019645624MaRDI QIDQ3922184
Alon Itai, Richard J. Lipton, Michael Rodeh, Christos H. Papadimitriou
Publication date: 1981
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0210058
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)
Related Items
Covering Multigraphs by Simple Circuits, Some properties of the fleet assignment problem, 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, Extensions of flow theorems, Circuit Covers of Signed Graphs, Shipper collaboration, The multi-tree approach to reliability in distributed networks, Routing problems: A bibliography, A note on shortest sign-circuit cover of signed 3-edge-colorable cubic graphs, Covering the edges of a graph by circuits, Minimum $T$-Joins and Signed-Circuit Covering, Covering a graph with cycles., Postman tours and cycle covers, Short cycle covers and the cycle double cover conjecture, Computation of minimal event bases that ensure diagnosability, A parallel algorithm for approximating the minimum cycle cover, A bound on the total size of a cut cover, Proofs of two minimum circuit cover conjectures, Shortest coverings of graphs with cycles, Nowhere zero flow and circuit covering in regular matroids, On shortest cocycle covers of graphs
