Edge constrained Eulerian extensions
From MaRDI portal
Publication:6629114
Cites work
- An Eulerian exposition
- Efficient algorithms for Eulerian extension and rural Postman
- On Eulerian extensions and their application to no-wait flowshop scheduling
- Parameterized complexity of connected even/odd subgraph problems
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- The spanning subgraphs of eulerian graphs
This page was built for publication: Edge constrained Eulerian extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6629114)