Circular flows of nearly Eulerian graphs and vertex-splitting

DOI10.1002/jgt.10040zbMath1004.05039OpenAlexW4230039044MaRDI QIDQ3150192

Cun-Quan Zhang

Publication date: 1 February 2003

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10040

zbMATH Keywords

circular flowvertex splittinginteger flownearly Eulerian graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items

Modulo orientations with bounded independence number ⋮ Nowhere-zero 3-flow of graphs with small independence number ⋮ \(Z_3\)-connectivity in abelian Cayley graphs ⋮ The Flow Index of Regular Class I Graphs ⋮ Graph factors modulo \(k\) ⋮ Contractible graphs for flow index less than three ⋮ Homomorphisms to small negative even cycles ⋮ Circular flows via extended Tutte orientations ⋮ Flows and parity subgraphs of graphs with large odd-edge-connectivity ⋮ Nearly nowhere-zero \(r\)-flow graphs ⋮ Nowhere-zero 3-flows of graphs with prescribed sizes of odd edge cuts ⋮ Nowhere-zero 3-flows and modulo \(k\)-orientations ⋮ Signed Graphs: From Modulo Flows to Integer-Valued Flows ⋮ Circuit decompositions and shortest circuit coverings of hypergraphs ⋮ Circular chromatic number of signed graphs ⋮ Edge-connectivity augmentation of graphs over symmetric parity families ⋮ Nowhere-zero 3-flows in Cayley graphs and Sylow 2-subgroups ⋮ Circular Flows in Planar Graphs ⋮ Nowhere-zero 3-flows in toroidal graphs ⋮ Homomorphisms of sparse signed graphs ⋮ Integer Flows and Modulo Orientations of Signed Graphs ⋮ Mapping Planar Graphs into Projective Cubes ⋮ A note about shortest cycle covers ⋮ Flows of 3-edge-colorable cubic signed graphs ⋮ Homomorphisms of Signed Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
• The chromatic numbers of graph bundles over cycles
• High-girth graphs avoiding a minor are nearly bipartite
• A note on the star chromatic number
• Star chromatic number
• A Reduction Method for Edge-Connectivity in Graphs
• On (k,d)-colorings and fractional nowhere-zero flows
• 4-chromatic projective graphs
• (2 + ?)-Coloring of planar graphs with large odd-girth
• On the Imbedding of Linear Graphs in Surfaces
• A Contribution to the Theory of Chromatic Polynomials
• Circular chromatic number: A survey