Labelled well quasi ordered classes of bounded linear clique-width
From MaRDI portal
Cites work
- \(k\)-NLC graphs and polynomial algorithms
- A Combinatorial Theorem for Trees
- A counterexample regarding labelled well-quasi-ordering
- Factorization forests of finite height
- Gap embedding for well-quasi-orderings
- Graph minors. XX: Wagner's conjecture
- Green's relations and their use in automata theory
- Handle-rewriting hypergraph grammars
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 7029306 (Why is no real title available?)
- scientific article; zbMATH DE number 3210032 (Why is no real title available?)
- scientific article; zbMATH DE number 3400958 (Why is no real title available?)
- Letter graphs and well-quasi-order by induced subgraphs
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
- Monadic second-order definable graph transductions: a survey
- Ordering by Divisibility in Abstract Algebras
- Regular solutions of language inequalities and well quasi-orders
- Subgraphs and well‐quasi‐ordering
- The finite power problem revisited.
- The Power of Priority Channel Systems
- The theory of well-quasi-ordering: a frequently discovered concept
- Well-quasi-order of relabel functions
- Well-quasi-ordering does not imply bounded clique-width
- Well-quasi-ordering versus clique-width
- When trees grow low: shrubs and fast \(\mathrm{MSO}_{1}\)
This page was built for publication: Labelled well quasi ordered classes of bounded linear clique-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310245)
