๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Collapsible biclaw-free graphs

โœ Scribed by Hong-Jian Lai; Xiangjuan Yao

Book ID
108113664
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
157 KB
Volume
306
Category
Article
ISSN
0012-365X

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

Collapsible graphs and matchings
Collapsible graphs and matchings
โœ Zhi-Hong Chen; Hong-Jian Lai ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 286 KB

## Abstract A graph __G__ is __collapsible__ if for every even subset __R__ โŠ† __V__(__G__), there is a spanning connected subgraph of __G__ whose set of odd degree vertices is __R__. A graph is __reduced__ if it does not have nontrivial collapsible subgraphs. Collapsible and reduced graphs are defi