Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 5 of 5 for “"nowhere-zero flow"”.

  1. Generalized nowhere zero flow

    … that at each vertex v ∈ V(G), ∂f(v), the net flow out from v, equals b( v). An A-nowhere-zero-flow (abbreviated as A-NZF) in G is a function f : E(G) A* such that at each vertex v ∈ V(G), ∂f(v) = 0.;In this paper, we investigate the group connectivity number Lambda g(G) = min{lcub}n : if A is …

    wvu Repository record for Generalized nowhere zero flow (opens in a new tab)

  2. Weighted Modulo Orientations of Graphs

    This dissertation focuses on the subject of nowhere-zero flow problems on graphs. Tutte's 5-Flow Conjecture (1954) states that every bridgeless graph admits a nowhere-zero 5-flow, and Tutte's 3-Flow Conjecture (1972) states that every 4-edge-connected graph admits a nowhere-zero 3-flow. Extending …

    wvu Repository record for Weighted Modulo Orientations of Graphs (opens in a new tab)

  3. Group Connectivity and Modulo Orientations of Graphs

    This dissertation focuses on the subject of nowhere-zero flow problems on graphs. Tutte's 5-Flow Conjecture (1954) states that every bridgeless graph admits a nowhere-zero 5-flow, and Tutte's 3-Flow Conjecture (1972) states that every 4-edge-connected graph admits a nowhere-zero 3-flow. Jaeger et …

    wvu Repository record for Group Connectivity and Modulo Orientations of Graphs (opens in a new tab)

  4. Algebraic Methods for Reducibility in Nowhere-Zero Flows

    We study reducibility for nowhere-zero flows. A reducibility proof typically consists of showing that some induced subgraphs cannot appear in a minimum counter-example to some conjecture. We derive algebraic proofs of reducibility. We define variables which in some sense count the number of …

    waterloo Repository record for Algebraic Methods for Reducibility in Nowhere-Zero Flows (opens in a new tab)

  5. Flows on Signed Graphs

    This dissertation focuses on integer flow problems within specific signed graphs. The theory of integer flows, which serves as a dual problem to vertex coloring of planar graphs, was initially introduced by Tutte as a tool related to the Four-Color Theorem. This theory has been extended to signed …

    wvu Repository record for Flows on Signed Graphs (opens in a new tab)