Recommendations
Cites work
- scientific article; zbMATH DE number 25645 (Why is no real title available?)
- scientific article; zbMATH DE number 3232673 (Why is no real title available?)
- scientific article; zbMATH DE number 3400958 (Why is no real title available?)
- Characterizations for restricted graphs of NLC-width 2
- Graph minors. XX: Wagner's conjecture
- Graph-Theoretic Concepts in Computer Science
- Handle-rewriting hypergraph grammars
- Induced subgraphs and well‐quasi‐ordering
- NLC\(_{2}\)-decomposition in polynomial time
- On Better-Quasi-Ordering Countable Series-Parallel Orders
- On well-quasi-ordering finite structures with labels
- Ordering by Divisibility in Abstract Algebras
- Recent developments on graphs of bounded clique-width
- The theory of well-quasi-ordering: a frequently discovered concept
- Theory of relations. Transl. from the French by P. Clote
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Well-quasiordering finite trees with gap-condition. Proof of Harvey Friedman's conjecture
- \(k\)-NLC graphs and polynomial algorithms
Cited in
(18)- Infinitely many minimal classes of graphs of unbounded clique-width
- Fixed points and Noetherian topologies
- Clique-width and well-quasi-ordering of triangle-free graph classes
- Well-quasi-ordering versus clique-width
- A counterexample regarding labelled well-quasi-ordering
- Well-quasi-ordering versus clique-width: new results on bigenic classes
- Forbidden substructures and combinatorial dichotomies: WQO and universality
- Well-quasi-ordering versus clique-width: new results on bigenic classes
- Labelled well-quasi-order for permutation classes
- Recent progress on well-quasi-ordering graphs
- On well-quasi-ordering finite structures with labels
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
- Well-quasi-ordering does not imply bounded clique-width
- A class of graphs with large rankwidth
- When locality meets preservation
- On using SAT solvers for graph computations
- Split permutation graphs
- Induced betweenness in order-theoretic trees
This page was built for publication: Well-quasi-order of relabel functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q603891)
