Subgraphs and well‐quasi‐ordering
From MaRDI portal
Publication:4020706
DOI10.1002/jgt.3190160509zbMath0762.05093OpenAlexW1988827593MaRDI QIDQ4020706
Publication date: 17 January 1993
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190160509
Related Items (36)
Labelled well-quasi-order for permutation classes ⋮ On the Verification of Timed Ad Hoc Networks ⋮ Ordered colourings ⋮ Combinatorial aspects of Davenport-Schinzel sequences ⋮ WQO is decidable for factorial languages ⋮ Petri Nets with Structured Data ⋮ Boundary properties of well-quasi-ordered sets of graphs ⋮ Well-quasi-ordering \(H\)-contraction-free graphs ⋮ Certifying coloring algorithms for graphs without long induced paths ⋮ Labelled induced subgraphs and well-quasi-ordering ⋮ A decidability result for the dominating set problem ⋮ Parameterized verification of time-sensitive models of ad hoc network protocols ⋮ On low tree-depth decompositions ⋮ Unnamed Item ⋮ Induced minors and well-quasi-ordering ⋮ Canonical antichains of unit interval and bipartite permutation graphs ⋮ Branch-depth: generalizing tree-depth of graphs ⋮ Recent Progress on Well-Quasi-ordering Graphs ⋮ Bipartite induced subgraphs and well-quasi-ordering ⋮ Stable sets versus independent sets ⋮ Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications ⋮ Split permutation graphs ⋮ Forbidden substructures and combinatorial dichotomies: WQO and universality ⋮ Two forbidden induced subgraphs and well-quasi-ordering ⋮ Parameterized verification of coverability in infinite state broadcast networks ⋮ WQO dichotomy for 3-graphs ⋮ Clique-width and well-quasi-ordering of triangle-free graph classes ⋮ Well-structured graph transformation systems ⋮ Weak and Nested Class Memory Automata ⋮ Parameterized verification of monotone information systems ⋮ On canonical antichains ⋮ Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs ⋮ Unnamed Item ⋮ Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure ⋮ Well-quasi-order for permutation graphs omitting a path and a clique ⋮ On well quasi-order of graph classes under homomorphic image orderings
Cites Work
This page was built for publication: Subgraphs and well‐quasi‐ordering
