The following pages link to (Q4166786):
Displaying 35 items.
- Cycle covers. II: Circuit chain, Petersen chain and Hamilton weights. (Q290803) (← links)
- Circuit extension and circuit double cover of graphs (Q390272) (← links)
- Cycle double covers and the semi-Kotzig frame (Q412256) (← links)
- Flows and parity subgraphs of graphs with large odd-edge-connectivity (Q444374) (← links)
- Signed cycle double covers (Q668036) (← links)
- Cycle covers of cubic multigraphs (Q686431) (← links)
- Postman tours and cycle covers (Q686511) (← links)
- Shortest coverings of graphs with cycles (Q802571) (← links)
- Parity and disparity subgraphs (Q1025535) (← links)
- Cycle covering in bridgeless graphs (Q1069955) (← links)
- On shortest cocycle covers of graphs (Q1070245) (← links)
- The multi-tree approach to reliability in distributed networks (Q1109560) (← links)
- Integer flows and cycle covers (Q1186130) (← links)
- A parallel algorithm for approximating the minimum cycle cover (Q1207326) (← links)
- Triangle-free circuit decompositions and Petersen minor (Q1272477) (← 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)
- Circuit decompositions and shortest circuit coverings of hypergraphs (Q1743689) (← links)
- Randomised algorithms (Q1836980) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Signed circuit cover of bridgeless signed graphs (Q2227982) (← links)
- Cycle covers. III: Compatible circuit decomposition and \(K_5\)-transition minor (Q2312600) (← links)
- Cycle double covers and non-separating cycles (Q2323102) (← 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)
- Graphs with the Circuit Cover Property (Q4305925) (← links)
- (Q5091249) (← links)
- Cubic Graphs with No Short Cycle Covers (Q5157388) (← links)
- Circuit Double Covers of Graphs (Q5506787) (← links)
- 5-Cycle Double Covers, 4-Flows, and Catlin Reduction (Q5883284) (← links)
- Five-cycle double cover and shortest cycle cover (Q6642514) (← links)
