Title of article
Grinsteadʹs conjecture is true for graphs with a small clique number Original Research Article
Author/Authors
Kenji Kashiwabara، نويسنده , , Tadashi Sakuma، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
10
From page
2572
To page
2581
Abstract
We will show that Grinsteadʹs Conjecture holds true if image. In other words; a circular partitionable graph G satisfying image is always a so-called “CGPW-graph”.
Keywords
Circular partitionable graph , CGPW-graph , Grinsteadיs conjecture
Journal title
Discrete Mathematics
Serial Year
2006
Journal title
Discrete Mathematics
Record number
948106
Link To Document