Circular flows of nearly Eulerian graphs and vertex‐splitting
- 2 May 2002
- journal article
- Published by Wiley in Journal of Graph Theory
- Vol. 40 (3) , 147-161
Abstract
The 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, 2002Keywords
This publication has 14 references indexed in Scilit:
- High-Girth Graphs Avoiding a Minor are Nearly BipartiteJournal of Combinatorial Theory, Series B, 2001
- (2 + ?)-Coloring of planar graphs with large odd-girthJournal of Graph Theory, 2000
- On (k,d)-colorings and fractional nowhere-zero flowsJournal of Graph Theory, 1998
- The chromatic numbers of graph bundles over cyclesDiscrete Mathematics, 1995
- A note on the star chromatic numberJournal of Graph Theory, 1990
- ON CIRCULAR FLOWS IN GRAPHS1984
- A Reduction Method for Edge-Connectivity in Graphs1978
- Eine gemeinsame Basis f r die Theorie der Eulerschen Graphen und den Satz von PetersenMonatshefte für Mathematik, 1976
- Graph Theory with Applications1976
- On the Imbedding of Linear Graphs in SurfacesProceedings of the London Mathematical Society, 1949