Article ID Journal Published Year Pages File Type
4650342 Discrete Mathematics 2008 8 Pages PDF
Abstract

Let GG be a simple graph on nn vertices. In this paper, we prove that if GG satisfies the condition that d(x)+d(y)≥nd(x)+d(y)≥n for each xy∈E(G)xy∈E(G), then GG has no nowhere-zero 3-flow if and only if GG is either one of the five graphs on at most 6 vertices or one of a very special class of graphs on at least 6 vertices.

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, ,