Hereditary classes of ordered sets of width at most two
From MaRDI portal
Publication:6563997
DOI10.1016/J.EJC.2023.103813MaRDI QIDQ6563997
Publication date: 28 June 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Boundary properties of well-quasi-ordered sets of graphs
- Pairs of orthogonal countable ordinals
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Canonical antichains of unit interval and bipartite permutation graphs
- The order on the rationals has an orthogonal order with the same order type
- Substitutions in dynamics, arithmetics and combinatorics
- Hereditary properties of partitions, ordered graphs and ordered hypergraphs
- Labelled induced subgraphs and well-quasi-ordering
- Critically prime interval orders
- Hereditary properties of tournaments
- On minimal prime graphs and posets
- Asymptotic enumeration of two-dimensional posets
- Ensemble ordonne universel recouvert par deux chaînes
- Condition de chaîne en théorie des rélations
- Prime two-dimensional orders and perpendicular total orders
- Letter graphs and well-quasi-order by induced subgraphs
- Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
- Countable linear orders with disjoint infinite intervals are mutually orthogonal
- A counterexample regarding labelled well-quasi-ordering
- Sur l'extension de l'ordre partiel.
- Homogeneous permutations
- The order type of the collection of finite series-parallel posets
- Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile
- An infinite antichain of permutations
- Orthogonal countable linear orders
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
- Rationality for subclasses of 321-avoiding permutations
- The unlabelled speed of a hereditary graph property
- On Fraissé's order type conjecture
- Simple permutations and pattern restricted permutations
- Infinite independent sets in distributive lattices
- A decomposition theorem for partially ordered sets
- Permutation classes
- Bipartite induced subgraphs and well-quasi-ordering
- Overview of some general results in combinatorial enumeration
- Relation Minimale Pour Son Ǎge
- The 3-Irreducible Partially Ordered Sets
- Chaînes de théories universelles
- Profile and hereditary classes of ordered relational structures
- On Better-Quasi-Ordering Countable Series-Parallel Orders
- Graphs containing finite induced paths of unbounded length
- Letter Graphs and Geometric Grid Classes of Permutations
- Labelled well-quasi-order for permutation classes
- Some relational structures with polynomial growth and their associated algebras II: Finite generation
- Transitiv orientierbare Graphen
- Induced subgraphs and well‐quasi‐ordering
- Ordering by Divisibility in Abstract Algebras
- Partial well‐ordering of sets of vectors
- Letter graphs and geometric grid classes of permutations: characterization and recognition
- Partially ordered sets.
- Sandwiches of ages
- Decomposition of infinite labeled 2-structures
This page was built for publication: Hereditary classes of ordered sets of width at most two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563997)