Labelled induced subgraphs and well-quasi-ordering

DOI10.1007/s11083-014-9333-9zbMath1325.05141OpenAlexW1977950997MaRDI QIDQ890007

Aistis Atminas, Vadim V. Lozin

Publication date: 9 November 2015

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-014-9333-9

zbMATH Keywords

induced subgraphwell-quasi-orderinfinite antichainlabelled induced subgraphs

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

Letter Graphs and Geometric Grid Classes of Permutations ⋮ Labelled well-quasi-order for permutation classes ⋮ Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs ⋮ WQO is decidable for factorial languages ⋮ Between clique-width and linear clique-width of bipartite graphs ⋮ Induced minors and well-quasi-ordering ⋮ Recent Progress on Well-Quasi-ordering Graphs ⋮ Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs ⋮ A counterexample regarding labelled well-quasi-ordering ⋮ Well-quasi-ordering versus clique-width: new results on bigenic classes ⋮ Clique-width and well-quasi-ordering of triangle-free graph classes ⋮ Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes ⋮ Letter graphs and modular decomposition ⋮ Well-quasi-order for permutation graphs omitting a path and a clique

Cites Work

• Unnamed Item
• Unnamed Item
• Stable sets versus independent sets
• A solution to a problem of Jacobson, Kézdy and Lehel
• Graph minors. XX: Wagner's conjecture
• On well-quasi-ordering finite structures with labels
• Modular decomposition and transitive orientation
• Finiteness theorems for graphs and posets obtained by compositions
• Letter graphs and well-quasi-order by induced subgraphs
• Two forbidden induced subgraphs and well-quasi-ordering
• The theory of well-quasi-ordering: a frequently discovered concept
• Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths
• Bipartite induced subgraphs and well-quasi-ordering
• Subgraphs and well‐quasi‐ordering
• BIPARTITE GRAPHS TOTALLY DECOMPOSABLE BY CANONICAL DECOMPOSITION
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Induced subgraphs and well‐quasi‐ordering
• Ordering by Divisibility in Abstract Algebras