Collapsible biclaw-free graphs
Hong-Jian Laia · 2006
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. © 2006 Elsevier B.V. All rights reserved.