Pages that link to "Item:Q802571"
From MaRDI portal
The following pages link to Shortest coverings of graphs with cycles (Q802571):
Displayed 24 items.
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Postman tours and cycle covers (Q686511) (← 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)
- Supereulerian graphs and excluded induced minors (Q1903724) (← 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)
- Covering Multigraphs by Simple Circuits (Q3703929) (← 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)