A cycle cover of a 2-edge-connected graph embedded with large face-width on an orientable surface
DOI10.1007/S11856-016-1297-6zbMATH Open1341.05135OpenAlexW2395486145MaRDI QIDQ2630867FDOQ2630867
Publication date: 22 July 2016
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11856-016-1297-6
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Distance in graphs (05C12) Paths and cycles (05C38) Connectivity (05C40)
Cites Work
- Graphs on surfaces
- Five-coloring maps on surfaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Disjoint paths, planarizing cycles, and spanning walks
- Short cycle covers and the cycle double cover conjecture
- Covering Multigraphs by Simple Circuits
- Shortest coverings of graphs with cycles
- Separating and nonseparating disjoint homotopic cycles in graph embeddings
- Fulkerson's conjecture and circuit covers
- Graphs on the torus and geometry of numbers
- Nowhere-zero flows in low genus graphs
- Title not available (Why is that?)
- Short circuit covers for regular matroids with a nowhere zero 5-flow
- Minimum cycle coverings and integer flows
- Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4
- Covering Graphs by Simple Circuits
- Cycle covers of graphs with a nowhere-zero 4-flow
Cited In (1)
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)
