Boundary properties of well-quasi-ordered sets of graphs
From MaRDI portal
Publication:382896
DOI10.1007/s11083-012-9272-2zbMath1276.05062MaRDI QIDQ382896
Igor Razgon, Vadim V. Lozin, Nicholas Korpelainen
Publication date: 22 November 2013
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11083-012-9272-2
05C35: Extremal problems in graph theory
05C75: Structural characterization of families of graphs
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Cites Work
- Boundary properties of graphs for algorithmic graph problems
- On partial well-order for monotone grid classes of permutations
- Grid classes and partial well order
- Partially well-ordered closed sets of permutations
- Graph minors. XX: Wagner's conjecture
- On easy and hard hereditary classes of graphs with respect to the independent set problem
- Profile classes and partial well-order for permutations
- \(r\)-bounded \(k\)-complete bipartite bihypergraphs and generalized split graphs
- Boundary classes of graphs for the dominating set problem
- Forbidden substructures and combinatorial dichotomies: WQO and universality
- Two forbidden induced subgraphs and well-quasi-ordering
- NP-hard graph problems and boundary classes of graphs
- Simple permutations: Decidability and unavoidable substructures
- Boundary Classes of Planar Graphs
- Subgraphs and well‐quasi‐ordering
- Induced subgraphs and well‐quasi‐ordering
- Ordering by Divisibility in Abstract Algebras
