"A decomposition approach to solve the selective graph coloring problem in ..."

Oylum Seker, Tínaz Ekim, Z. Caner Taskin (2019)

> Home

Details and statistics

DOI: 10.1002/NET.21850

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/SekerET19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/SekerET19
Oylum Seker, Tínaz Ekim, Z. Caner Taskin:
A decomposition approach to solve the selective graph coloring problem in some perfect graph families. Networks 73(2): 145-169 (2019)

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.