Pages that link to "Item:Q1069955"
From MaRDI portal
The following pages link to Cycle covering in bridgeless graphs (Q1069955):
Displaying 22 items.
- Postman tours and cycle covers (Q686511) (← links)
- Covering weighted graphs by even subgraphs (Q753842) (← links)
- Shipper collaboration (Q858256) (← links)
- Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width (Q1003668) (← links)
- On shortest cocycle covers of graphs (Q1070245) (← links)
- Cycle double covers of graphs with Hamilton paths (Q1089005) (← links)
- Integer flows and cycle covers (Q1186130) (← links)
- Covering odd cycles (Q1272187) (← links)
- Extensions of flow theorems (Q1354719) (← links)
- Covering a graph with cycles. (Q1406651) (← links)
- Proofs of two minimum circuit cover conjectures (Q1569041) (← links)
- The minimum rooted-cycle cover problem (Q1661868) (← links)
- Nash-Williams' cycle-decomposition theorem (Q1714950) (← links)
- Covering and Euler cycles on non-oriented graphs (Q1714975) (← links)
- Circuit decompositions and shortest circuit coverings of hypergraphs (Q1743689) (← links)
- Circuit coverings of graphs and a conjecture of Pyber (Q1898727) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- A bound on the total size of a cut cover (Q2484376) (← links)
- A note about shortest cycle covers (Q2581631) (← links)
- Cycle and cocycle coverings of graphs (Q3061188) (← links)
- On a property of cyclic covers ofp-graphs (Q3784100) (← links)
- Smallest (1, 2)‐eulerian weight and shortest cycle covering (Q4284101) (← links)