Title of article
Collapsible biclaw-free graphs
Author/Authors
Hongjian Lai، نويسنده , , Xiangjuan Yao، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
3
From page
2115
To page
2117
Abstract
A graph is called biclaw-free if it has no biclaw as an induced subgraph. In this note, we prove that if image is a connected bipartite biclaw-free graph with image, then image is collapsible, and of course supereulerian. This bound is best possible.
Keywords
Collapsible graphs , Biclaw-free graphs , Supereulerian graphs
Journal title
Discrete Mathematics
Serial Year
2006
Journal title
Discrete Mathematics
Record number
948064
Link To Document