AbstractWe show if the flow polynomial of a bridgeless graph G has only integral roots, then G is the dual graph to a planar chordal graph. We also show that for 3-connected cubic graphs, the same conclusion holds under the weaker hypothesis that it has only real flow roots. Expressed in the language of matroid theory, this result says that the cographic matroids with only integral characteristic roots are the cycle matroids of planar chordal graphs
It was conjectured by Tutte that every 4-edge-connected graph admits a nowhere-zero $3$-flow. In thi...
Using the decomposition theory of modular and integral flow polynomials, we answer a problem of Beck...
The max-flow min-cut theorem and the two-commodity flow theorem may both be interpreted as equalitie...
AbstractWe show if the flow polynomial of a bridgeless graph G has only integral roots, then G is th...
AbstractAn (oriented) graph H is said to be Fk(k ≥ 2) iff there exists an integer flow in H with all...
AbstractLet P(G,t) and F(G,t) denote the chromatic and flow polynomials of a graph G. Woodall has sh...
AbstractUsing the decomposition theory of modular and integral flow polynomials, we answer a problem...
AbstractIt is known that the chromatic polynomial and flow polynomial of a graph are two important e...
AbstractIt is known that the chromatic polynomial of any chordal graph has only integer roots. Howev...
AbstractIn this article, we introduce certain flow polynomials associated with digraphs and use them...
In 1972, Tutte posed the 3-Flow Conjecture: that all 4-edge-connected graphs have a nowhere zero 3-f...
The number of nowhere zero ZQ flows on a graph G can be shown to be a polynomial in Q, defining the ...
Tutte observed that every nowhere-zero $k$-flow on a plane graph gives rise to a $k$-vertex-coloring...
AbstractGeneral results on nowhere-zero integral chain groups are proved and then specialized to the...
The aim of this thesis is to show and put together the results, obtained so far, useful to tackle a ...
It was conjectured by Tutte that every 4-edge-connected graph admits a nowhere-zero $3$-flow. In thi...
Using the decomposition theory of modular and integral flow polynomials, we answer a problem of Beck...
The max-flow min-cut theorem and the two-commodity flow theorem may both be interpreted as equalitie...
AbstractWe show if the flow polynomial of a bridgeless graph G has only integral roots, then G is th...
AbstractAn (oriented) graph H is said to be Fk(k ≥ 2) iff there exists an integer flow in H with all...
AbstractLet P(G,t) and F(G,t) denote the chromatic and flow polynomials of a graph G. Woodall has sh...
AbstractUsing the decomposition theory of modular and integral flow polynomials, we answer a problem...
AbstractIt is known that the chromatic polynomial and flow polynomial of a graph are two important e...
AbstractIt is known that the chromatic polynomial of any chordal graph has only integer roots. Howev...
AbstractIn this article, we introduce certain flow polynomials associated with digraphs and use them...
In 1972, Tutte posed the 3-Flow Conjecture: that all 4-edge-connected graphs have a nowhere zero 3-f...
The number of nowhere zero ZQ flows on a graph G can be shown to be a polynomial in Q, defining the ...
Tutte observed that every nowhere-zero $k$-flow on a plane graph gives rise to a $k$-vertex-coloring...
AbstractGeneral results on nowhere-zero integral chain groups are proved and then specialized to the...
The aim of this thesis is to show and put together the results, obtained so far, useful to tackle a ...
It was conjectured by Tutte that every 4-edge-connected graph admits a nowhere-zero $3$-flow. In thi...
Using the decomposition theory of modular and integral flow polynomials, we answer a problem of Beck...
The max-flow min-cut theorem and the two-commodity flow theorem may both be interpreted as equalitie...