✦ LIBER ✦

Well Quasi Ordering Finite Posets and Formal Languages

✍ Scribed by J. Gustedt

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 504 KB
Volume: 65
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1995.1045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Subgraphs and well-quasi-ordering

✍ Guoli Ding 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 712 KB

## Abstract Let 𝒴 be a class of graphs and let ⪯ be the subgraph or the induced subgraph relation. We call ⪯ an __ideal__ (with respect to ⪯) if ⪯ implies that ⪯. In this paper, we study the ideals that are well‐quasiordered by ⪯. The following are our main results. If ⪯ is the subgraph relation, w

Induced subgraphs and well-quasi-orderin

Induced subgraphs and well-quasi-ordering

✍ Peter Damaschke 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 428 KB

## Abstract We study classes of finite, simple, undirected graphs that are (1) lower ideals (or hereditary) in the partial order of graphs by the induced subgraph relation ≤~i~, and (2) well‐quasi‐ordered (WQO) by this relation. The main result shows that the class of cographs (__P~4~__‐free graphs

Bipartite induced subgraphs and well-qua

Bipartite induced subgraphs and well-quasi-ordering

✍ Nicholas Korpelainen; Vadim V. Lozin 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 238 KB

We study bipartite graphs partially ordered by the induced subgraph relation. Our goal is to distinguish classes of bipartite graphs that are or are not well-quasi-ordered (wqo) by this relation. Answering an open question from [J Graph Theory 16 (1992), 489-502], we prove that P 7 -free bipartite g

Branch-Width and Well-Quasi-Ordering in

Branch-Width and Well-Quasi-Ordering in Matroids and Graphs

✍ James F. Geelen; A.M.H. Gerards; Geoff Whittle 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 172 KB

Well quasi-ordered sets and ideals in fr

Well quasi-ordered sets and ideals in free semigroups and algebras

✍ J.C Robson 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 858 KB

The order-interval hypergraph of a finit

The order-interval hypergraph of a finite poset and the König property

✍ Isma Bouchemakh; Konrad Engel 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 561 KB

We study the hypergraph ~(P) whose vertices are the points of a finite poset and whose edges are the maximal intervals in P (i.e. sets of the form I = {v ~ P:p <~ v <<. q}, p minimal, q maximal). We mention resp. show that the problems of the determination of the independence number c~, the point co