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.

• Type: Journal
• Year: 2006
• Where: DM
• Authors: Hong-Jian Lai, Xiangjuan Yao
• Keywords: Bipartite Biclaw-free Graph, DM 2006