Nowhere-zero 3-flows in squares of graphs
From MaRDI portal
Publication:1856351
zbMath1018.05031MaRDI QIDQ1856351
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
90B10: Deterministic network models in operations research
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C75: Structural characterization of families of graphs
05C15: Coloring of graphs and hypergraphs
05C20: Directed graphs (digraphs), tournaments
Related Items
\(Z_3\)-connectivity in abelian Cayley graphs, A dual version of the brooks group coloring theorem, Nowhere-zero 3-flows and modulo \(k\)-orientations, Group connectivity in line graphs, \(Z_3\)-connectivity of 4-edge-connected 2-triangular graphs, Nowhere-zero 3-flows in Cayley graphs and Sylow 2-subgroups, Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity, Nowhere-zero 3-flows in triangularly connected graphs, On group connectivity of graphs, Group connectivity in \(J_3\) line graphs, Group connectivity and group colorings of graphs --- a survey, Computing square roots of trivially perfect and threshold graphs, Two equivalent properties of \(\mathcal Z_3\)-connectivity, Spanning triangle-trees and flows of graphs
