"Classes of graphs with low complexity: The case of classes with bounded ..."

Jaroslav Nesetril et al. (2021)

> Home

Details and statistics

DOI: 10.1016/J.EJC.2020.103223

access: closed

type: Journal Article

metadata version: 2022-10-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ejc/NesetrilMRS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ejc/NesetrilMRS21
Jaroslav Nesetril, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz:
Classes of graphs with low complexity: The case of classes with bounded linear rankwidth. Eur. J. Comb. 91: 103223 (2021)

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.