Shortest coverings of graphs with cycles
From MaRDI portal
Publication:802571
DOI10.1016/0095-8956(83)90056-4zbMATH Open0559.05037OpenAlexW1968068042MaRDI QIDQ802571FDOQ802571
Authors: Bill Jackson, François Jaeger, Jean-Claude Bermond 
Publication date: 1983
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-02447197/file/58-BJJ83-coveringcycles.pdf
Recommendations
Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Matching, Euler tours and the Chinese postman
- Every planar map is four colorable. I: Discharging
- Graph theory with applications
- Title not available (Why is that?)
- Maximum matching and a polyhedron with 0,1-vertices
- Flows and generalized coloring theorems in graphs
- A Reduction Method for Edge-Connectivity in Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimally 2-connected graphs.
- On Minimal Blocks
- Title not available (Why is that?)
- Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
- A Practical Approach to Nonlinear Fuzzy Regression
- Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden
- Covering Graphs by Simple Circuits
Cited In (68)
- A note on shortest cycle covers of cubic graphs
- Short circuit covers for regular matroids with a nowhere zero 5-flow
- Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits
- An overview of graph covering and partitioning
- Postman tours and cycle covers
- The lattice of cycles of an undirected graph
- Short cycle covers of graphs with at most 77\% vertices of degree two
- The construction and reduction of strong snarks
- Graphs with the Circuit Cover Property
- Title not available (Why is that?)
- Circuit double covers of graphs
- Group flow, complex flow, unit vector flow, and the \((2 + \epsilon)\)-flow conjecture
- Cycle covering in bridgeless graphs
- A note on Berge-Fulkerson coloring
- Semi-duality and the cycle double cover conjecture
- Supereulerian graphs and excluded induced minors
- Covering Multigraphs by Simple Circuits
- A note about shortest cycle covers
- 1-factor and cycle covers of cubic graphs
- Idealness of \(k\)-wise intersecting families
- Signed cycle double covers
- Integer flows and cycle covers
- Short cycle covers on cubic graphs by choosing a 2-factor
- Integer 4-flows and cycle covers
- On \(d\)-dimensional nowhere-zero \(r\)-flows on a graph
- Short cycle covers of cubic graphs
- Sharp bounds for the Chinese postman problem in 3-regular graphs and multigraphs
- A bound on the total size of a cut cover
- Cubic graphs with no short cycle covers
- Shortest circuit covers of signed graphs
- Extensions of flow theorems
- Graph theory (algorithmic, algebraic, and metric problems)
- Short signed circuit covers of signed graphs
- Covering a graph with cycles.
- Cycle double covers of infinite planar graphs
- Characteristic flows on signed graphs and short circuit covers
- Berge-Fulkerson coloring for some families of superposition snarks
- Short cycle covers of graphs and nowhere-zero flows
- Circuit covers of signed Eulerian graphs
- Circuit covers of signed Eulerian graphs
- Signed circuit cover of bridgeless signed graphs
- Idealness of \(k\)-wise intersecting families
- Covering weighted graphs by even subgraphs
- Title not available (Why is that?)
- Projective, affine, and abelian colorings of cubic graphs
- Title not available (Why is that?)
- 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
- Shipper collaboration
- Short cycle covers and the cycle double cover conjecture
- Edge-disjoint spanning trees and forests of graphs
- On bipartite restrictions of binary matroids
- Circuit covers of signed graphs
- On the approximation ratio of the random Chinese postman tour for network search
- Circuit decompositions and shortest circuit coverings of hypergraphs
- A note on finding a shortest complete cycle in an undirected graph
- Nowhere zero flow and circuit covering in regular matroids
- Proofs of two minimum circuit cover conjectures
- Minimum \(T\)-joins and signed-circuit covering
- On shortest cocycle covers of graphs
- A cycle cover of a 2-edge-connected graph embedded with large face-width on an orientable surface
- Berge–Fulkerson coloring for C(12)‐linked permutation graphs
- Smallest (1, 2)‐eulerian weight and shortest cycle covering
- Total dual dyadicness and dyadic generating sets
- Five-cycle double cover and shortest cycle cover
- Title not available (Why is that?)
- Lightweight paths in graphs
This page was built for publication: Shortest coverings of graphs with cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q802571)
