✦ LIBER ✦

Partition of a graph into cycles and vertices

✍ Scribed by Zhiquan Hu; Hao Li

Book ID: 108113613
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 139 KB
Volume: 307
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2005.11.081

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partition of a graph into cycles and deg

Partition of a graph into cycles and degenerated cycles

✍ Hikoe Enomoto; Hao Li 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 177 KB

Let G be a graph of order n and k any positive integer with k 6 n. It has been shown by Brandt et al. that if |G| = n ¿ 4k and if the degree sum of any pair of nonadjacent vertices is at least n, then G can be partitioned into k cycles. We prove that if the degree sum of any pair of nonadjacent vert

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

Partitioning Vertices of a Tournament in

Partitioning Vertices of a Tournament into Independent Cycles

✍ Guantao Chen; Ronald J. Gould; Hao Li 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 108 KB

Let k be a positive integer. A strong digraph G is termed k-connected if the removal of any set of fewer than k vertices results in a strongly connected digraph. The purpose of this paper is to show that every k-connected tournament with at least 8k vertices contains k vertex-disjoint directed cycle