Abstract
AbstractThe odd edge connectivity of a graph G, denoted by λo(G), is the size of a smallest odd edge cut of the graph. Let S be any given surface and ϵ be a positive real number. We proved that there is a function fS(ϵ) (depends on the surface S and limϵ→0 fS(ϵ)=∞) such that any graph G embedded in S with the odd‐edge connectivity at least fS(ϵ) admits a nowhere‐zero circular (2+ϵ)‐flow. Another major result of the work is a new vertex splitting lemma which maintains the old edge connectivity and graph embedding. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 147–161, 2002
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
