EnglishSvenskaNorsk
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Algorithms and minimal forbidden minors for tree-decomposable graphs
Stockholm University.
1991 (English)Doctoral thesis, monograph (Other academic)
Place, publisher, year, edition, pages
Stockholm, 1991.
Series
Trita-NA, 0348-2952 ; 9104
Identifiers
URN: urn:nbn:se:su:diva-173946Libris ID: 1189840OAI: oai:DiVA.org:su-173946DiVA, id: diva2:1356691
Note

Diss. Stockholm : Univ.

Available from: 2019-10-02 Created: 2019-10-02 Last updated: 2020-09-17Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

PDF (Not accessible to users outside Sweden)
By organisation
Stockholm University

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 44 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
v. 2.47.0
|
WCAG
|
Stockholm University Library
|
DiVA portal
|
DiVA Contact
|
DiVA Log in