Pages that link to "Item:Q802571"
From MaRDI portal
The following pages link to Shortest coverings of graphs with cycles (Q802571):
Displaying 50 items.
- Characteristic flows on signed graphs and short circuit covers (Q311542) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- On bipartite restrictions of binary matroids (Q648977) (← links)
- Signed cycle double covers (Q668036) (← links)
- Postman tours and cycle covers (Q686511) (← links)
- Cycle double covers of infinite planar graphs (Q726631) (← links)
- Group flow, complex flow, unit vector flow, and the \((2 + \epsilon)\)-flow conjecture (Q740648) (← links)
- Covering weighted graphs by even subgraphs (Q753842) (← links)
- Shipper collaboration (Q858256) (← links)
- A note on Berge-Fulkerson coloring (Q1043939) (← links)
- Cycle covering in bridgeless graphs (Q1069955) (← links)
- Nowhere zero flow and circuit covering in regular matroids (Q1070235) (← links)
- On shortest cocycle covers of graphs (Q1070245) (← links)
- Semi-duality and the cycle double cover conjecture (Q1085163) (← links)
- Short circuit covers for regular matroids with a nowhere zero 5-flow (Q1112053) (← links)
- Integer flows and cycle covers (Q1186130) (← links)
- Short cycle covers and the cycle double cover conjecture (Q1204464) (← links)
- Extensions of flow theorems (Q1354719) (← links)
- The construction and reduction of strong snarks (Q1356495) (← links)
- Covering a graph with cycles. (Q1406651) (← links)
- Proofs of two minimum circuit cover conjectures (Q1569041) (← links)
- Shortest circuit covers of signed graphs (Q1633748) (← links)
- Short signed circuit covers of signed graphs (Q1682878) (← links)
- On the approximation ratio of the random Chinese postman tour for network search (Q1694817) (← links)
- Integer 4-flows and cycle covers (Q1743175) (← links)
- Circuit decompositions and shortest circuit coverings of hypergraphs (Q1743689) (← links)
- Supereulerian graphs and excluded induced minors (Q1903724) (← links)
- Edge-disjoint spanning trees and forests of graphs (Q2028071) (← links)
- Berge-Fulkerson coloring for some families of superposition snarks (Q2033883) (← links)
- Idealness of \(k\)-wise intersecting families (Q2118114) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- A note on shortest sign-circuit cover of signed 3-edge-colorable cubic graphs (Q2168862) (← links)
- Short cycle covers of graphs with at most 77\% vertices of degree two (Q2213807) (← links)
- Circuit covers of signed Eulerian graphs (Q2223467) (← links)
- Signed circuit cover of bridgeless signed graphs (Q2227982) (← links)
- The lattice of cycles of an undirected graph (Q2228498) (← links)
- Sharp bounds for the Chinese postman problem in 3-regular graphs and multigraphs (Q2352793) (← links)
- A bound on the total size of a cut cover (Q2484376) (← links)
- Projective, affine, and abelian colorings of cubic graphs (Q2519796) (← links)
- A note about shortest cycle covers (Q2581631) (← links)
- A cycle cover of a 2-edge-connected graph embedded with large face-width on an orientable surface (Q2630867) (← links)
- Circuit \(k\)-covers of signed graphs (Q2656955) (← links)
- Short Cycle Covers on Cubic Graphs by Choosing a 2-Factor (Q2832575) (← links)
- A note on shortest cycle covers of cubic graphs (Q2911057) (← links)
- On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings (Q2922223) (← links)
- Short cycle covers of graphs and nowhere-zero flows (Q3106270) (← links)
- 1‐Factor and Cycle Covers of Cubic Graphs (Q4982281) (← links)
- Lightweight paths in graphs (Q5106693) (← links)
- Berge–Fulkerson coloring for C(12)‐linked permutation graphs (Q6056765) (← links)
- On \(d\)-dimensional nowhere-zero \(r\)-flows on a graph (Q6085497) (← links)
