A cycle cover of a 2-edge-connected graph embedded with large face-width on an orientable surface
From MaRDI portal
Publication:2630867
Recommendations
Cites work
- scientific article; zbMATH DE number 3905413 (Why is no real title available?)
- scientific article; zbMATH DE number 3966112 (Why is no real title available?)
- scientific article; zbMATH DE number 3600081 (Why is no real title available?)
- Covering Graphs by Simple Circuits
- Covering Multigraphs by Simple Circuits
- Cycle covers of graphs with a nowhere-zero 4-flow
- Disjoint paths, planarizing cycles, and spanning walks
- Five-coloring maps on surfaces
- Fulkerson's conjecture and circuit covers
- Graphs on surfaces
- Graphs on the torus and geometry of numbers
- Minimum cycle coverings and integer flows
- Nowhere-zero flows in low genus graphs
- Separating and nonseparating disjoint homotopic cycles in graph embeddings
- Short circuit covers for regular matroids with a nowhere zero 5-flow
- Short cycle covers and the cycle double cover conjecture
- Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4
- Shortest coverings of graphs with cycles
This page was built for publication: A cycle cover of a 2-edge-connected graph embedded with large face-width on an orientable surface
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2630867)