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
AbstractWe find three non-planar graphs which are flow-equivalent to planar graphs. It is also shown...
The study of nowhere-zero flows began with a key observation of Tutte that in planar graphs, nowhere...
We show that every bridgeless cubic graph without a Petersen minor has a nowhere-zero 5-flow. This a...
AbstractWe show if the flow polynomial of a bridgeless graph G has only integral roots, then G is th...
AbstractIn this article, we introduce certain flow polynomials associated with digraphs and use them...
AbstractIt is known that the chromatic polynomial of any chordal graph has only integer roots. Howev...
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...
Using the decomposition theory of modular and integral flow polynomials, we answer a problem of Beck...
AbstractIt is known that the chromatic polynomial and flow polynomial of a graph are two important e...
For every graph that is clique equivalent to a connected chordal graph, it is shown that the associa...
AbstractIn this paper we study relations between nowhere-zero Zk− and integer-valued flows in graphs...
AbstractAn (oriented) graph H is said to be Fk(k ≥ 2) iff there exists an integer flow in H with all...
AbstractWe give an upper bound and a class of lower bounds on the coefficients of the characteristic...
AbstractAn orientation of a graph is acyclic (totally cyclic) if and only if it is a “positive orien...
AbstractWe find three non-planar graphs which are flow-equivalent to planar graphs. It is also shown...
The study of nowhere-zero flows began with a key observation of Tutte that in planar graphs, nowhere...
We show that every bridgeless cubic graph without a Petersen minor has a nowhere-zero 5-flow. This a...
AbstractWe show if the flow polynomial of a bridgeless graph G has only integral roots, then G is th...
AbstractIn this article, we introduce certain flow polynomials associated with digraphs and use them...
AbstractIt is known that the chromatic polynomial of any chordal graph has only integer roots. Howev...
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...
Using the decomposition theory of modular and integral flow polynomials, we answer a problem of Beck...
AbstractIt is known that the chromatic polynomial and flow polynomial of a graph are two important e...
For every graph that is clique equivalent to a connected chordal graph, it is shown that the associa...
AbstractIn this paper we study relations between nowhere-zero Zk− and integer-valued flows in graphs...
AbstractAn (oriented) graph H is said to be Fk(k ≥ 2) iff there exists an integer flow in H with all...
AbstractWe give an upper bound and a class of lower bounds on the coefficients of the characteristic...
AbstractAn orientation of a graph is acyclic (totally cyclic) if and only if it is a “positive orien...
AbstractWe find three non-planar graphs which are flow-equivalent to planar graphs. It is also shown...
The study of nowhere-zero flows began with a key observation of Tutte that in planar graphs, nowhere...
We show that every bridgeless cubic graph without a Petersen minor has a nowhere-zero 5-flow. This a...
DOI
Add to ORKG