"Computing clique and chromatic number of circular-perfect graphs in ..."

Arnaud Pêcher, Annegret Katrin Wagler (2013)

> Home

Details and statistics

DOI: 10.1007/S10107-012-0512-4

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mp/PecherW13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/PecherW13
Arnaud Pêcher, Annegret Katrin Wagler:
Computing clique and chromatic number of circular-perfect graphs in polynomial time. Math. Program. 141(1-2): 121-133 (2013)

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.