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 “"Integer flows"”.

  1. Integer flows and Modulo Orientations

    Tutte's 3-flow conjecture (1970's) states that every 4-edge-connected graph admits a nowhere-zero 3-flow. A graph G admits a nowhere-zero 3-flow if and only if G has an orientation such that the out-degree equals the in-degree modulo 3 for every vertex. In the 1980ies Jaeger suggested some related …

    wvu Repository record for Integer flows and Modulo Orientations (opens in a new tab)

  2. Cycle Double Covers and Integer Flows

    … namely the cycle double cover conjecture and the integer flows conjectures. This kind of problem is undoubtedly one of the major catalysts in the tremendous development of graph theory. It was observed by Tutte that the Four color problem can be formulated in terms of integer flows, as well as …

    wvu Repository record for Cycle Double Covers and Integer Flows (opens in a new tab)

  3. Integer Flows and Circuit Covers of Graphs and Signed Graphs

    … Jaeger's pioneering work on converting modulo flows into integer-valued flows for ordinary graphs. For a signed graphs (G, sigma), we first prove that for each k ∈ {lcub}2, 3{rcub}, if (G, sigma) is (k -- 1)-edge-connected and contains an even number of negative edges when k = 2, then every …

    wvu Repository record for Integer Flows and Circuit Covers of Graphs and Signed Graphs (opens in a new tab)

  4. Graph coloring and flows

    … result is further generalized for every positive integer Delta. That is, chi s FD ≥ 2Delta for every Delta ∈ Z+ . It was proved by M. Albertson, G. Chappell, H. Kierstead, A. Kundgen, R. Ramamurthi (EJC 2004) that chis( FD ) ≤ Delta(Delta - 1) + 2. In this paper, a simplified proof is given and …

    wvu Repository record for Graph coloring and 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)