A cycle cover of a 2-edge-connected graph embedded with large face-width on an orientable surface

DOI10.1007/s11856-016-1297-6zbMath1341.05135OpenAlexW2395486145MaRDI QIDQ2630867

Dengju Ma, Han Ren

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

zbMATH Keywords

bridgeless graphshortest cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Shortest coverings of graphs with cycles
• Short circuit covers for regular matroids with a nowhere zero 5-flow
• Short cycle covers and the cycle double cover conjecture
• Five-coloring maps on surfaces
• Graphs on the torus and geometry of numbers
• Fulkerson's conjecture and circuit covers
• Separating and nonseparating disjoint homotopic cycles in graph embeddings
• Disjoint paths, planarizing cycles, and spanning walks
• Minimum cycle coverings and integer flows
• Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4
• Covering Multigraphs by Simple Circuits
• Nowhere-zero flows in low genus graphs
• Covering Graphs by Simple Circuits
• Cycle covers of graphs with a nowhere-zero 4-flow