Tangle and Maximal Ideal (Q2980900)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Tangle and Maximal Ideal	scientific article

Statements

scholarly article

0 references

Tangle and Maximal Ideal (English)

0 references

10.1007/978-3-319-53925-6_7

0 references

Koichi Yamazaki

0 references

WALCOM: Algorithms and Computation

0 references

publication date

5 May 2017

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

zbMATH Keywords

tangle

0 references

ideal

0 references

submodularity

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-53925-6_7

0 references

0 references

Submodular partition functions

0 references

0 references

Quickly excluding a forest

0 references

Tangles, trees, and flowers

0 references

0 references

Ends and tangles

0 references

Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract)

0 references

On the monotonicity of games generated by symmetric submodular functions.

0 references

Obstructions to branch-decomposition of matroids

0 references

Codensity and the ultrafilter monad

0 references

Partitions versus sets: a case of duality

0 references

Testing branch-width

0 references

0 references

Graph minors. X: Obstructions to tree-decomposition

0 references

Graph searching and a min-max theorem for tree-width

0 references

Call routing and the ratcatcher

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2980900

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2980900&oldid=36319654"