Pages that link to "Item:Q3922184"
From MaRDI portal
The following pages link to Covering Graphs by Simple Circuits (Q3922184):
Displaying 22 items.
- Postman tours and cycle covers (Q686511) (← links)
- Computation of minimal event bases that ensure diagnosability (Q692381) (← links)
- Shortest coverings of graphs with cycles (Q802571) (← links)
- Shipper collaboration (Q858256) (← links)
- Nowhere zero flow and circuit covering in regular matroids (Q1070235) (← links)
- On shortest cocycle covers of graphs (Q1070245) (← links)
- The multi-tree approach to reliability in distributed networks (Q1109560) (← links)
- Short cycle covers and the cycle double cover conjecture (Q1204464) (← links)
- A parallel algorithm for approximating the minimum cycle cover (Q1207326) (← links)
- Some properties of the fleet assignment problem (Q1332950) (← links)
- Extensions of flow theorems (Q1354719) (← links)
- Covering a graph with cycles. (Q1406651) (← links)
- Proofs of two minimum circuit cover conjectures (Q1569041) (← links)
- Routing problems: A bibliography (Q1908308) (← 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)
- A bound on the total size of a cut cover (Q2484376) (← links)
- A cycle cover of a 2-edge-connected graph embedded with large face-width on an orientable surface (Q2630867) (← links)
- Circuit Covers of Signed Graphs (Q3466359) (← links)
- Covering the edges of a graph by circuits (Q3496358) (← links)
- Covering Multigraphs by Simple Circuits (Q3703929) (← links)
- Minimum $T$-Joins and Signed-Circuit Covering (Q5112825) (← links)
