Decompositions of complete tripartite graphs into triangles with an edge attached

Let K(r, s, t) denote the complete tripartite graph with partite sets of size r, s and t, where r less than or equal to s less than or equal to t. Let D be the graph consisting of a triangle with an edge attached. We show that K(r, s, t) may be decomposed into copies of D if and only if 4 divides rs + st + rt and t less than or equal to 3rs/(r + s).

Decompositions of complete graphs into triangles and Hamilton cycles

For all odd integers n greater than or equal to 1, let G(n) denote the complete graph of order n, and for all even integers n greater than or equal to 2 let G,, denote the complete graph of order n with the edges of a 1-factor removed. It is shown that for all non-negative integers h and t and all positive integers n, G, can be decomposed into h Hamilton cycles and t triangles if and only if nh + 3t is the number of edges in G(n). (C) 2004 Wiley Periodicals, Inc.

Export processing zones and growth triangle development: The case of the BIMP-EAGA, Southeast Asia

Exorts processing zones (EPZs) and growth triangles have been two common Asian initiatives to increase wealth and regional competitiveness in the world economy. Since they are seldom analysed jointly, this paper investigates their mutuality in the development process. Taking the problematic case of the Brunei-Indonesia-Malaysia-Philippines East ASEAN Growth Area (BIMP-EAGA) triangle, we explore the role of EPZs in enhancing regional collaboration, competitiveness, and domestic linkages. Despite the triangle's weak economic complementarities, its processing zones are found capable of advancing development by furthering opportunities in regionalisation/localisation of production. Latterly, trade and investment liberalisation within ASEAN raises broad questions about the rationale of EPZs and growth triangles. Zone-triangle nexuses will require rethinking as, under different regulatory conditions, the zones compete more directly across ASEAN and also with global rivals. Copyright © 2005 John Wiley & Sons, Ltd.