"\mathbb F\mathbb F-Rank-Width of (Edge-Colored) Graphs."

Mamadou Moustapha Kanté, Michaël Rao (2011)

> Home

Details and statistics

DOI: 10.1007/978-3-642-21493-6_10

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cai/KanteR11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cai/KanteR11
Mamadou Moustapha Kanté, Michaël Rao:
\mathbb F\mathbb F-Rank-Width of (Edge-Colored) Graphs. CAI 2011: 158-173

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.