Boundary properties of well-quasi-ordered sets of graphs

DOI10.1007/S11083-012-9272-2zbMATH Open1276.05062OpenAlexW1996873316MaRDI QIDQ382896FDOQ382896

Authors: Nicholas Korpelainen, Vadim Lozin, Igor Razgon 

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

Recommendations

• Two forbidden induced subgraphs and well-quasi-ordering
• Well-quasi-ordering versus clique-width
• Induced subgraphs and well‐quasi‐ordering
• Well-quasi-orders in subclasses of bounded treewidth graphs
• Labelled induced subgraphs and well-quasi-ordering

zbMATH Keywords

induced subgraphswell-quasi-order

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Cites Work

• Graph minors. XX: Wagner's conjecture
• On easy and hard hereditary classes of graphs with respect to the independent set problem
• Boundary classes of graphs for the dominating set problem
• NP-hard graph problems and boundary classes of graphs
• Subgraphs and well‐quasi‐ordering
• Boundary properties of graphs for algorithmic graph problems
• \(r\)-bounded \(k\)-complete bipartite bihypergraphs and generalized split graphs
• Boundary Classes of Planar Graphs
• Two forbidden induced subgraphs and well-quasi-ordering
• Profile classes and partial well-order for permutations
• Forbidden substructures and combinatorial dichotomies: WQO and universality
• Simple permutations: Decidability and unavoidable substructures
• Induced subgraphs and well‐quasi‐ordering
• Ordering by Divisibility in Abstract Algebras
• On partial well-order for monotone grid classes of permutations
• Grid classes and partial well order
• Partially well-ordered closed sets of permutations

Cited In (12)

• Hereditary classes of ordered sets of width at most two
• Critical properties of bipartite permutation graphs
• Clique-width and well-quasi-ordering of triangle-free graph classes
• A counterexample regarding labelled well-quasi-ordering
• Upper domination: towards a dichotomy through boundary properties
• Title not available (Why is that?)
• Labelled well-quasi-order for permutation classes
• Recent progress on well-quasi-ordering graphs
• Critical hereditary graph classes: a survey
• A boundary property for upper domination
• Well-quasi-ordering and Embeddability of Relational Structures
• Between clique-width and linear clique-width of bipartite graphs

This page was built for publication: Boundary properties of well-quasi-ordered sets of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q382896)