Shortest coverings of graphs with cycles
From MaRDI portal
Publication:802571
Recommendations
Cites work
- scientific article; zbMATH DE number 3966112 (Why is no real title available?)
- scientific article; zbMATH DE number 3728302 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3600081 (Why is no real title available?)
- A Practical Approach to Nonlinear Fuzzy Regression
- A Reduction Method for Edge-Connectivity in Graphs
- Covering Graphs by Simple Circuits
- Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
- Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden
- Every planar map is four colorable. I: Discharging
- Flows and generalized coloring theorems in graphs
- Graph theory with applications
- Matching, Euler tours and the Chinese postman
- Maximum matching and a polyhedron with 0,1-vertices
- Minimally 2-connected graphs.
- On Minimal Blocks
Cited in
(67)- Smallest (1, 2)‐eulerian weight and shortest cycle covering
- Total dual dyadicness and dyadic generating sets
- Berge–Fulkerson coloring for C(12)‐linked permutation graphs
- Lightweight paths in graphs
- Five-cycle double cover and shortest cycle cover
- scientific article; zbMATH DE number 1205987 (Why is no real title available?)
- A cycle cover of a 2-edge-connected graph embedded with large face-width on an orientable surface
- Covering weighted graphs by even subgraphs
- Shortest circuit covers of signed graphs
- Extensions of flow theorems
- On bipartite restrictions of binary matroids
- Covering Multigraphs by Simple Circuits
- Cycle covering in bridgeless graphs
- scientific article; zbMATH DE number 6783459 (Why is no real title available?)
- Circuit decompositions and shortest circuit coverings of hypergraphs
- A note about shortest cycle covers
- Graph theory (algorithmic, algebraic, and metric problems)
- A note on finding a shortest complete cycle in an undirected graph
- The construction and reduction of strong snarks
- Nowhere zero flow and circuit covering in regular matroids
- Minimum \(T\)-joins and signed-circuit covering
- On the approximation ratio of the random Chinese postman tour for network search
- Idealness of \(k\)-wise intersecting families
- 1-factor and cycle covers of cubic graphs
- Signed cycle double covers
- Berge-Fulkerson coloring for some families of superposition snarks
- An overview of graph covering and partitioning
- Sharp bounds for the Chinese postman problem in 3-regular graphs and multigraphs
- Covering a graph with cycles.
- Short cycle covers of graphs and nowhere-zero flows
- Short cycle covers on cubic graphs by choosing a 2-factor
- Short signed circuit covers of signed graphs
- Cycle double covers of infinite planar graphs
- Short cycle covers of cubic graphs
- scientific article; zbMATH DE number 1843998 (Why is no real title available?)
- On shortest cocycle covers of graphs
- A note on shortest cycle covers of cubic graphs
- Postman tours and cycle covers
- Graphs with the Circuit Cover Property
- Proofs of two minimum circuit cover conjectures
- scientific article; zbMATH DE number 1033814 (Why is no real title available?)
- Shipper collaboration
- Projective, affine, and abelian colorings of cubic graphs
- Edge-disjoint spanning trees and forests of graphs
- Short circuit covers for regular matroids with a nowhere zero 5-flow
- Integer flows and cycle covers
- Circuit double covers of graphs
- A note on Berge-Fulkerson coloring
- Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits
- Characteristic flows on signed graphs and short circuit covers
- Circuit covers of signed Eulerian graphs
- Semi-duality and the cycle double cover conjecture
- Integer 4-flows and cycle covers
- Circuit covers of signed Eulerian graphs
- Signed circuit cover of bridgeless signed graphs
- Short cycle covers and the cycle double cover conjecture
- A bound on the total size of a cut cover
- Group flow, complex flow, unit vector flow, and the \((2 + \epsilon)\)-flow conjecture
- Cubic graphs with no short cycle covers
- The lattice of cycles of an undirected graph
- Short cycle covers of graphs with at most 77\% vertices of degree two
- On \(d\)-dimensional nowhere-zero \(r\)-flows on a graph
- Circuit covers of signed graphs
- Circuit \(k\)-covers of signed graphs
- A note on shortest sign-circuit cover of signed 3-edge-colorable cubic graphs
- Supereulerian graphs and excluded induced minors
- Idealness of \(k\)-wise intersecting families
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)
