𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hamiltonicity of bipartite biclaw-free graphs

✍ Scribed by E. Flandrin; J.L. Fouquet; H. Li

Book ID
104183142
Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
464 KB
Volume
51
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Dominating cycles in bipartite biclaw-fr
Dominating cycles in bipartite biclaw-free graphs
✍ Daniel Barraez; Evelyne Flandrin; Hao Li; Oscar Ordaz πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 354 KB

Flandrin et ai. (to appear) define a simple bipartite graph to be biclaw-free if it contains no induced subgraph isomorphic to H, where H could be obtained from two copies of K1.3 by adding an edge joining the two vertices of degree 3. They have shown that if G is a bipartite, balanced, biclaw-free

Bipartite Graphs, Hamiltonicity and grap
Bipartite Graphs, Hamiltonicity and graphs
✍ Rahman, M. Sohel; Kaykobad, M.; Kaykobad, Md. Tanvir πŸ“‚ Article πŸ“… 2013 πŸ› Elsevier Science 🌐 English βš– 182 KB
Collapsible biclaw-free graphs
Collapsible biclaw-free graphs
✍ Hong-Jian Lai; Xiangjuan Yao πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 157 KB
Hamiltonicity for K1, r-free graphs
Hamiltonicity for K1, r-free graphs
✍ Guantao Chen; R. H. Schelp πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 719 KB

## Abstract In this paper, we investigate the Hamiltonicity of __K__~1,r~‐free graphs with some degree conditions. In particular, let __G__ be a __k__‐connected grph of order __n__≧3 which is __K__~1,4~‐free. If magnified image for every independent set {__v__~0~, __v__~1~, …, __v__~k~} then __G__