"On the choosability of complete multipartite graphs with part size three."

Henry A. Kierstead (2000)

> Home

Details and statistics

DOI: 10.1016/S0012-365X(99)00157-0

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/Kierstead00a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/Kierstead00a
Henry A. Kierstead:
On the choosability of complete multipartite graphs with part size three. Discret. Math. 211: 255-259 (2000)

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.