Pages that link to "Item:Q3703929"
From MaRDI portal
The following pages link to Covering Multigraphs by Simple Circuits (Q3703929):
Displaying 41 items.
- Characteristic flows on signed graphs and short circuit covers (Q311542) (← links)
- Generation and properties of snarks (Q463288) (← links)
- Signed cycle double covers (Q668036) (← links)
- Covering weighted graphs by even subgraphs (Q753842) (← links)
- Shipper collaboration (Q858256) (← links)
- Nowhere zero flow and circuit covering in regular matroids (Q1070235) (← links)
- Integer flows and cycle covers (Q1186130) (← links)
- Short cycle covers and the cycle double cover conjecture (Q1204464) (← links)
- A parallel algorithm for approximating the minimum cycle cover (Q1207326) (← links)
- Extensions of flow theorems (Q1354719) (← 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)
- Integer 4-flows and cycle covers (Q1743175) (← links)
- Circuit decompositions and shortest circuit coverings of hypergraphs (Q1743689) (← links)
- Towards obtaining a 3-decomposition from a perfect matching (Q2094896) (← 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)
- Signed circuit cover of bridgeless signed graphs (Q2227982) (← links)
- A bound on the total size of a cut cover (Q2484376) (← 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)
- Circuit Covers of Signed Graphs (Q3466359) (← links)
- Short cycle covers of cubic graphs (Q4284099) (← links)
- Smallest (1, 2)‐eulerian weight and shortest cycle covering (Q4284101) (← links)
- Graphs with the Circuit Cover Property (Q4305925) (← links)
- 1‐Factor and Cycle Covers of Cubic Graphs (Q4982281) (← links)
- Minimum $T$-Joins and Signed-Circuit Covering (Q5112825) (← links)
- Cubic Graphs with No Short Cycle Covers (Q5157388) (← links)
- Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits (Q5210904) (← links)
- Circuit Covers of Signed Eulerian Graphs (Q5232136) (← links)
- Some snarks are worse than others (Q6181999) (← links)
- Five-cycle double cover and shortest cycle cover (Q6642514) (← links)
- On Fan's conjecture about 4-flow (Q6660059) (← links)
