Well-quasi-ordering hereditarily finite sets
From MaRDI portal
Publication:2855754
Recommendations
Cites work
- scientific article; zbMATH DE number 42735 (Why is no real title available?)
- A classification of the expressive power of well-structured transition systems
- A well-quasi-order for tournaments
- Ackermann encoding, bisimulations and OBDDs
- Decomposition of Graphs into Two-Way Infinite Paths
- Digraph measures: Kelly decompositions, games, and orderings
- Directed tree-width
- Graph minors XXIII. Nash-Williams' immersion conjecture
- Graph minors. XX: Wagner's conjecture
- Hypersets
- Well-quasi-ordering hereditarily finite sets
- Well-structured transition systems everywhere!
Cited in
(6)- scientific article; zbMATH DE number 599450 (Why is no real title available?)
- Well‐quasi‐ordering and finite distinguishing number
- Digraph parameters and finite set arithmetic
- Is hyper-extensionality preservable under deletions of graph elements?
- Set graphs. II. Complexity of set graph recognition and similar problems
- Well-quasi-ordering hereditarily finite sets
This page was built for publication: Well-quasi-ordering hereditarily finite sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2855754)