Displaying similar documents to “Cubic graphs without a Petersen minor have nowhere-zero 5-flow.”

Dense Granular Poiseuille Flow

E. Khain (2011)

Mathematical Modelling of Natural Phenomena

Similarity:

We consider a dense granular shear flow in a two-dimensional system. Granular systems (composed of a large number of macroscopic particles) are far from equilibrium due to inelastic collisions between particles: an external driving is needed to maintain the motion of particles. Theoretical description of driven granular media is especially challenging for dense granular flows. This paper focuses on a gravity-driven dense granular Poiseuille...

On bounded channel flows of viscoelastic fluids

Marshall J. Leitman, Epifanio G. Virga (1988)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti

Similarity:

We show that the smooth bounded channel flows of a viscoelastic fluid exhibit the following qualitative feature: Whenever the channel is sufficiently wide, any bounded velocity field satisfying the homogeneous equation of motion is such that if the flow stops at some time, then the flow is never unidirectional throughout the channel. We first demonstrate the qualitative property of the bounded channel flows. Then we show explicitly how a piecewise linear approximation of a relaxation...

On bounded channel flows of viscoelastic fluids

Marshall J. Leitman, Epifanio G. Virga (1988)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

Similarity:

We show that the smooth bounded channel flows of a viscoelastic fluid exhibit the following qualitative feature: Whenever the channel is sufficiently wide, any bounded velocity field satisfying the homogeneous equation of motion is such that if the flow stops at some time, then the flow is never unidirectional throughout the channel. We first demonstrate the qualitative property of the bounded channel flows. Then we show explicitly how a piecewise linear approximation of a relaxation...

Flows on the join of two graphs

Robert Lukoťka, Edita Rollová (2013)

Mathematica Bohemica

Similarity:

The join of two graphs G and H is a graph formed from disjoint copies of G and H by connecting each vertex of G to each vertex of H . We determine the flow number of the resulting graph. More precisely, we prove that the join of two graphs admits a nowhere-zero 3 -flow except for a few classes of graphs: a single vertex joined with a graph containing an isolated vertex or an odd circuit tree component, a single edge joined with a graph containing only isolated edges, a single edge plus...