Grinstead's conjecture is true for graphs with a small clique number

@article{Kashiwabara2006GrinsteadsCI,
  title={Grinstead's conjecture is true for graphs with a small clique number},
  author={Kenji Kashiwabara and Tadashi Sakuma},
  journal={Discrete Mathematics},
  year={2006},
  volume={306},
  pages={2572-2581}
}
We will show that Grinstead's Conjecture holds true ifmin(@a(G),@w(G))=<8. In other words; a circular partitionable graph G satisfyingmin(@a(G),@w(G))=<8is always a so-called ''CGPW-graph''. 

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-2 OF 2 CITATIONS

On CIS Circulants

Endre Boros, Vladimir Gurvich, Martin Milanič
  • Discrete Mathematics
  • 2014
VIEW 2 EXCERPTS
CITES BACKGROUND

On circulant thin Lehman matrices

  • Electronic Notes in Discrete Mathematics
  • 2011
VIEW 2 EXCERPTS
CITES BACKGROUND