The complexity of the zero-sum 3-flows

DOI10.1016/j.ipl.2014.10.004zbMath1305.05093OpenAlexW2010160097MaRDI QIDQ477676

Mohammad-Reza Sadeghi, Ali Dehghan

Publication date: 9 December 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.10.004

zbMATH Keywords

combinatorial problemsnowhere-zero flowzero-sum flow\((2,3)\)-semiregular graphzero-sum conjecture

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Flows in graphs (05C21)

Related Items (2)

On the algorithmic complexity of zero-sum edge-coloring ⋮ Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications

Cites Work

• Unnamed Item
• Unnamed Item
• A note on zero-sum 5-flows in regular graphs
• Zero-sum flows in regular graphs
• Degree sum and nowhere-zero 3-flows
• Nowhere-zero 4-flow in almost Petersen-minor free graphs
• On zero-sum 6-flows of graphs
• Nowhere-zero integral flows on a bidirected graph
• Nowhere-zero 3-flows of highly connected graphs
• Nowhere-zero 4-flows and cycle double covers
• A generalization of 0-sum flows in graphs
• Nowhere-zero 3-flows and \(Z_{3}\)-connectivity of a family of graphs
• Zero-Sum Flow Numbers of Regular Graphs
• Constant Sum Flows in Regular Graphs
• Zero-sum flows in designs
• The NP-Completeness of Edge-Coloring
• Nowhere-zero eigenvectors of graphs
• Paths, Trees, and Flowers
• On the Imbedding of Linear Graphs in Surfaces
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: The complexity of the zero-sum 3-flows