✦ LIBER ✦

Optimal partition of a bipartite graph into non-crossing matchings

✍ Scribed by Federico Malucelli; Sara Nicoloso

Book ID: 108498011
Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 239 KB
Volume: 10
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00390-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partition of a bipartite graph into cycl

Partition of a bipartite graph into cycles

✍ Hong Wang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 241 KB

Wang, H., Partition of bipartite graph into cycles, Discrete Mathematics 117 (1993) 287-291. El-Zahar (1984) conjectured that if G is a graph on n, + n, + + nk vertices with ni > 3 for 1s i < k and minimum degree 6(G)>rn,/21+rn2/21+ ... +rn,/21, then G contains k vertex-disjoint cycles of lengths n,

Partition the vertices of a graph into i

Partition the vertices of a graph into induced matchings

✍ Jinjiang Yuan; Qin Wang 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 97 KB

Partition of a bipartite hamiltonian gra

Partition of a bipartite hamiltonian graph into two cycles

✍ Denise Amar 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 480 KB

We prove the following theorem. "I'neorem. If G is a balanced bipartite graph with bipartition (A, B), [A I = IBI = n, such that for any x ~ A, y ~ B, d(x) + d(y) >>-n + 2, then for any (nl, n2), ni >I 2, n -----n I + hE, G contains two independent cycles of lengths 2nl and 2n2.

Partition of a directed bipartite graph

Partition of a directed bipartite graph into two directed cycles

✍ Hong Wang; Charles Little; Kee Teo 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 356 KB

Let D = (V1, V2; A) be a directed bipartite graph with II/11 = 11/21 = n ~> 2. Suppose that do(x) + do(y) >~ 3n + 1 for all xe I/1 and ye V2. Then D contains two vertex-disjoint directed cycles of lengths 2nl and 2n2, respectively, for any positive integer partition n = n~ + n2. Moreover, the condit

Partition a graph with small diameter in

Partition a graph with small diameter into two induced matchings

✍ Aifeng Yang; Jinjiang Yuan 📂 Article 📅 2004 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 344 KB

Partitioning the edge set of a bipartite

Partitioning the edge set of a bipartite graph into chain packings: complexity of some variations

✍ D. de Werra 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 154 KB

An extension of the decomposition theorem of Birkhoff-von Neumann theorem is given for the case where entries can be positive or negative. The special case of an integral matrix is discussed and some balancing properties which are trivial for the classical case (non-negative entries only in the matr