"The Complexity of the List Partition Problem for Graphs."

Kathie Cameron et al. (2007)

> Home

Details and statistics

DOI: 10.1137/060666238

access: closed

type: Journal Article

metadata version: 2020-04-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamdm/CameronEHS07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/CameronEHS07
Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan:
The Complexity of the List Partition Problem for Graphs. SIAM J. Discret. Math. 21(4): 900-929 (2007)

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.