Two forbidden induced subgraphs and well-quasi-ordering
From MaRDI portal
Publication:2275404
DOI10.1016/J.DISC.2011.04.023zbMATH Open1223.05132OpenAlexW2122172628MaRDI QIDQ2275404FDOQ2275404
Authors: Nicholas Korpelainen, Vadim Lozin 
Publication date: 8 August 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.04.023
Recommendations
- Induced subgraphs and well‐quasi‐ordering
- Bipartite induced subgraphs and well-quasi-ordering
- Labelled induced subgraphs and well-quasi-ordering
- Subgraphs and well‐quasi‐ordering
- Forbidden induced subgraphs for bounded \(p\)-intersection number
- Forbidden induced subgraphs of double-split graphs
- Forbidden induced subgraphs for perfect matchings
- Forbidden induced subgraphs for near perfect matchings
- Near-complete multipartite graphs and forbidden induced subgraphs
- Forbidden set of induced subgraphs for 2-connected supereulerian graphs
Cites Work
- Graph minors. XX: Wagner's conjecture
- Modular decomposition and transitive orientation
- Subgraphs and well‐quasi‐ordering
- Paw-free graphs
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
- Induced subgraphs and well‐quasi‐ordering
- Ordering by Divisibility in Abstract Algebras
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Letter graphs and well-quasi-order by induced subgraphs
- Stable sets versus independent sets
- A solution to a problem of Jacobson, Kézdy and Lehel
- Bipartite induced subgraphs and well-quasi-ordering
Cited In (33)
- Letter graphs and geometric grid classes of permutations: characterization and recognition
- Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs
- Critical properties of bipartite permutation graphs
- Clique-width and well-quasi-ordering of triangle-free graph classes
- Hereditary classes of graphs: a parametric approach
- On well-quasi-ordering-finite graphs by immersion
- Well-quasi-ordering versus clique-width
- Letter graphs and well-quasi-order by induced subgraphs
- A counterexample regarding labelled well-quasi-ordering
- Well-quasi-ordering versus clique-width: new results on bigenic classes
- Well-quasi-ordering versus clique-width: new results on bigenic classes
- On well quasi-order of graph classes under homomorphic image orderings
- Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
- Labelled induced subgraphs and well-quasi-ordering
- Well-quasi-order for permutation graphs omitting a path and a clique
- Labelled well-quasi-order for permutation classes
- Forbidden induced partial orders
- Forbidden ordered subgraph vs. forbidden subgraph characterizations of graph classes
- Recent progress on well-quasi-ordering graphs
- Word-Representable Graphs: a Survey
- Well-quasi-ordering does not imply bounded clique-width
- Well-quasi-orders in subclasses of bounded treewidth graphs
- WQO dichotomy for 3-graphs
- Combinatorics and algorithms for quasi-chain graphs
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
- Sandwiches missing two ingredients of order four
- Deciding the Bell number for hereditary graph properties
- WQO is decidable for factorial languages
- Graphs containing finite induced paths of unbounded length
- Subgraphs and well‐quasi‐ordering
- Boundary properties of well-quasi-ordered sets of graphs
- Induced subgraphs and well‐quasi‐ordering
- Bipartite induced subgraphs and well-quasi-ordering
This page was built for publication: Two forbidden induced subgraphs and well-quasi-ordering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275404)
