# Discrete Applied Mathematics

Discrete Applied Mathematics > 1997 > 78 > 1-3 > 189-205

Discrete Applied Mathematics > 1997 > 78 > 1-3 > 283-289

_{5}. Our main tool is a separating set notion known as a handle.

Discrete Applied Mathematics > 1997 > 78 > 1-3 > 163-174

Discrete Applied Mathematics > 1997 > 78 > 1-3 > 207-226

Discrete Applied Mathematics > 1997 > 78 > 1-3 > 17-26

Discrete Applied Mathematics > 1997 > 78 > 1-3 > 41-50

Discrete Applied Mathematics > 1997 > 78 > 1-3 > 133-152

Discrete Applied Mathematics > 1997 > 78 > 1-3 > 235-249

Discrete Applied Mathematics > 1997 > 78 > 1-3 > 153-162

Discrete Applied Mathematics > 1997 > 78 > 1-3 > 117-132

Discrete Applied Mathematics > 1997 > 78 > 1-3 > 61-74

Discrete Applied Mathematics > 1997 > 78 > 1-3 > 1-16

Discrete Applied Mathematics > 1997 > 78 > 1-3 > 27-40

_{0}(M) and W

_{1}(M) denote the modules of all vertex and edge weightings over M, respectively. An incidence weighting η of G is a weighting of each incident vertex-edge pair (v,e) with an element of D. Now consider an orientation of the edges of G. Let δ

_{η}denote...

Discrete Applied Mathematics > 1997 > 78 > 1-3 > 251-282

Discrete Applied Mathematics > 1997 > 78 > 1-3 > 291-298

Discrete Applied Mathematics > 1997 > 78 > 1-3 > 175-187

Discrete Applied Mathematics > 1997 > 78 > 1-3 > 227-233

Discrete Applied Mathematics > 1997 > 78 > 1-3 > 89-102

Discrete Applied Mathematics > 1997 > 78 > 1-3 > 103-116

^{D}

^{-}

^{2}(3d

^{3}- 2d

^{2}+ 4d - d(d mod 2) - 4) and 14d

^{D}

^{-}

^{1}(3d

^{2}+ 4d + (d mod 2)), respectively. Also we show that the shuffle-exchange graph S(D), D > 2 can be embedded in 3 pages with cumulative...