Nowhere-zero 3-flows in squares of graphs

17Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

It was conjectured by Tutte that every 4-edge-connected graph admits a nowhere-zero 3-flow. In this paper, we give a complete characterization of graphs whose squares admit nowhere-zero 3-flows and thus confirm Tutte's 3-flow conjecture for the family of squares of graphs.

Cite

CITATION STYLE

APA

Xu, R., & Zhang, C. Q. (2003). Nowhere-zero 3-flows in squares of graphs. Electronic Journal of Combinatorics, 10(1 R). https://doi.org/10.37236/1698

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free