Nowhere-zero 3-flows in squares of graphs

zbMath1018.05031MaRDI QIDQ1856351

Rui Xu, Cun-Quan Zhang

Publication date: 13 May 2003

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/122804

zbMATH Keywords

nowhere-zero flowsquares of graphs

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (14)

Two equivalent properties of \(\mathcal Z_3\)-connectivity ⋮ Spanning triangle-trees and flows of graphs ⋮ \(Z_3\)-connectivity in abelian Cayley graphs ⋮ Group connectivity and group colorings of graphs --- a survey ⋮ A dual version of the brooks group coloring theorem ⋮ Group connectivity in line graphs ⋮ Computing square roots of trivially perfect and threshold graphs ⋮ Nowhere-zero 3-flows and modulo \(k\)-orientations ⋮ \(Z_3\)-connectivity of 4-edge-connected 2-triangular graphs ⋮ Nowhere-zero 3-flows in triangularly connected graphs ⋮ Nowhere-zero 3-flows in Cayley graphs and Sylow 2-subgroups ⋮ On group connectivity of graphs ⋮ Group connectivity in \(J_3\) line graphs ⋮ Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity

This page was built for publication: Nowhere-zero 3-flows in squares of graphs