"Computing the clique number of aa-perfect graphs in polynomial time."

Arnaud Pêcher, Annegret Wagler (2014)

> Home

Details and statistics

DOI: 10.1016/J.EJC.2013.06.025

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/ejc/PecherW14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ejc/PecherW14
Arnaud Pêcher, Annegret Wagler:
Computing the clique number of aa-perfect graphs in polynomial time. Eur. J. Comb. 35: 449-458 (2014)

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.