Effective computation of immersion obstructions for unions of graph classes (Q395009)
From MaRDI portal
(Redirected from Item:Q2904552)
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Effective computation of immersion obstructions for unions of graph classes |
scientific article; zbMATH DE number 6065667
- Effective Computation of Immersion Obstructions for Unions of Graph Classes
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Effective computation of immersion obstructions for unions of graph classes |
scientific article; zbMATH DE number 6065667 |
|
Statements
Effective computation of immersion obstructions for unions of graph classes (English)
0 references
Effective Computation of Immersion Obstructions for Unions of Graph Classes (English)
0 references
28 January 2014
0 references
14 August 2012
0 references
immersions
0 references
obstructions
0 references
unique linkage theorem
0 references
tree-width
0 references
0 references
0 references
0.986909568309784
0 references
0.8090646862983704
0 references
0.7734151482582092
0 references
0.7559865713119507
0 references
0.7358067035675049
0 references
