Sciweavers

Share
DM
2006

Collapsible biclaw-free graphs

9 years 5 months ago
Collapsible biclaw-free graphs
A graph is called biclaw-free if it has no biclaw as an induced subgraph. In this note, we prove that if G is a connected bipartite biclaw-free graph with (G) 5, then G is collapsible, and of course supereulerian. This bound is best possible.
Hong-Jian Lai, Xiangjuan Yao
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where DM
Authors Hong-Jian Lai, Xiangjuan Yao
Comments (0)
books