"Infinitely many minimal classes of graphs of unbounded clique-width."

Andrew Collins et al. (2018)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2017.02.012

access: closed

type: Journal Article

metadata version: 2020-03-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dam/CollinsFKLZ18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/CollinsFKLZ18
Andrew Collins, Jan Foniok, Nicholas Korpelainen, Vadim V. Lozin, Victor Zamaraev:
Infinitely many minimal classes of graphs of unbounded clique-width. Discret. Appl. Math. 248: 145-152 (2018)

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.