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

Kenji Kashiwabara, Tadashi Sakuma (2006)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2005.12.040

access: open

type: Journal Article

metadata version: 2023-10-21

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/KashiwabaraS06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/KashiwabaraS06
Kenji Kashiwabara, Tadashi Sakuma:
Grinstead's conjecture is true for graphs with a small clique number. Discret. Math. 306(19-20): 2572-2581 (2006)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.