Well-quasi-order of relabel functions
From MaRDI portal
Publication:603891
DOI10.1007/S11083-010-9174-0zbMATH Open1209.05210OpenAlexW2020139369MaRDI QIDQ603891FDOQ603891
Authors: Jean Daligault, Michaël Rao, Stéphan Thomassé 
Publication date: 8 November 2010
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11083-010-9174-0
Recommendations
Cites Work
- Graph minors. XX: Wagner's conjecture
- Theory of relations. Transl. from the French by P. Clote
- Handle-rewriting hypergraph grammars
- Recent developments on graphs of bounded clique-width
- The theory of well-quasi-ordering: a frequently discovered concept
- Induced subgraphs and well‐quasi‐ordering
- Ordering by Divisibility in Abstract Algebras
- \(k\)-NLC graphs and polynomial algorithms
- Well-quasiordering finite trees with gap-condition. Proof of Harvey Friedman's conjecture
- Title not available (Why is that?)
- NLC2-DECOMPOSITION IN POLYNOMIAL TIME
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- On Better-Quasi-Ordering Countable Series-Parallel Orders
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph-Theoretic Concepts in Computer Science
- Characterizations for restricted graphs of NLC-width 2
- On well-quasi-ordering finite structures with labels
Cited In (18)
- Fixed points and Noetherian topologies
- Infinitely many minimal classes of graphs of unbounded clique-width
- Clique-width and well-quasi-ordering of triangle-free graph classes
- Well-quasi-ordering versus clique-width
- A counterexample regarding labelled well-quasi-ordering
- 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
- On well-quasi-ordering finite structures with labels
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
- A class of graphs with large rankwidth
- Induced minors and well-quasi-ordering
- When locality meets preservation
- Recent Progress on Well-Quasi-ordering Graphs
- Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes
- Well-quasi-ordering Does Not Imply Bounded Clique-width
- Induced betweenness in order-theoretic trees
- Split permutation graphs
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)
