✦ LIBER ✦

Vertex-disjoint hexagons with chords in a bipartite graph

✍ Scribed by Hong Wang

Book ID: 108316203
Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 571 KB
Volume: 187
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00236-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vertex-disjoint chorded cycles in a grap

Vertex-disjoint chorded cycles in a graph

✍ Shengning Qiao; Shenggui Zhang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 208 KB

On Vertex-Disjoint Complete Bipartite Su

On Vertex-Disjoint Complete Bipartite Subgraphs in a Bipartite Graph

✍ Hong Wang 📂 Article 📅 1999 🏛 Springer Japan 🌐 English ⚖ 150 KB

Large Vertex-Disjoint Cycles in a Bipart

Large Vertex-Disjoint Cycles in a Bipartite Graph

✍ Hong Wang 📂 Article 📅 2000 🏛 Springer Japan 🌐 English ⚖ 100 KB

Vertex-disjoint cycles containing specif

Vertex-disjoint cycles containing specified vertices in a bipartite graph

✍ Guantao Chen; Hikoe Enomoto; Ken-ichi Kawarabayashi; Katsuhiro Ota; Dingjun Lou; 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB

## Abstract A minimum degree condition is given for a bipartite graph to contain a 2‐factor each component of which contains a previously specified vertex. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 145–166, 2004

Vertex-disjoint quadrilaterals containin

Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph

✍ Jin Yan; Guizhen Liu 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 282 KB

Disjoint cycles with chords in graphs

✍ Ch. Sobhan Babu; Ajit A. Diwan 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

## Abstract Let $n\_1,n\_2,\ldots,n\_k$ be integers, $n=\sum n\_i$, $n\_i\ge 3$, and let for each $1\le i\le k$, $H\_i$ be a cycle or a tree on $n\_i$ vertices. We prove that every graph __G__ of order at least __n__ with $\sigma\_2(G) \ge 2( n-k) -1$ contains __k__ vertex disjoint subgraphs $H\_1'