✦ LIBER ✦

On Covering a Bipartite Graph with Cycles

✍ Scribed by Wang, Hong

Book ID: 118198126
Publisher: Society for Industrial and Applied Mathematics
Year: 2001
Tongue: English
Weight: 186 KB
Volume: 15
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480196310487

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Covering a graph with cycles

✍ Hong Wang 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 444 KB

## Abstract Let __k__ and __n__ be two integers such that __k__ ≥ 0 and __n__ ≥ 3(__k__ + 1). Let __G__ be a graph of order __n__ with minimum degree at least ⌈(__n__ + __k__)/2⌉. Then __G__ contains __k__ + 1 independent cycles covering all the vertices of __G__ such that __k__ of them are triangl

Strong Covering of a Bipartite Graph

✍ McWhirter, I. P.; Younger, D. H. 📂 Article 📅 1971 🏛 Oxford University Press 🌐 English ⚖ 150 KB

On Independent Cycles in a Bipartite Gra

On Independent Cycles in a Bipartite Graph

✍ Hong Wang 📂 Article 📅 2001 🏛 Springer Japan 🌐 English ⚖ 104 KB

Packing bipartite graphs with covers of

Packing bipartite graphs with covers of complete bipartite graphs

✍ Chalopin, Jérémie; Paulusma, Daniël 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 385 KB

Covering a graph by complete bipartite g

Covering a graph by complete bipartite graphs

✍ P. Erdo&#x030B;s; L. Pyber 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 119 KB

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,