The following pages link to Subgraphs and well‐quasi‐ordering (Q4020706):
Displayed 36 items.
- Boundary properties of well-quasi-ordered sets of graphs (Q382896) (← links)
- A decidability result for the dominating set problem (Q410736) (← links)
- Canonical antichains of unit interval and bipartite permutation graphs (Q651422) (← links)
- Stable sets versus independent sets (Q686148) (← links)
- Well-structured graph transformation systems (Q729812) (← links)
- Labelled induced subgraphs and well-quasi-ordering (Q890007) (← links)
- Parameterized verification of time-sensitive models of ad hoc network protocols (Q896913) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- On canonical antichains (Q1011785) (← links)
- Combinatorial aspects of Davenport-Schinzel sequences (Q1356764) (← links)
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
- Parameterized verification of monotone information systems (Q1798673) (← links)
- Ordered colourings (Q1896351) (← links)
- Split permutation graphs (Q2014716) (← links)
- Parameterized verification of coverability in infinite state broadcast networks (Q2029598) (← links)
- Branch-depth: generalizing tree-depth of graphs (Q2225398) (← links)
- Forbidden substructures and combinatorial dichotomies: WQO and universality (Q2275384) (← links)
- Two forbidden induced subgraphs and well-quasi-ordering (Q2275404) (← links)
- Well-quasi-order for permutation graphs omitting a path and a clique (Q2344822) (← links)
- On well quasi-order of graph classes under homomorphic image orderings (Q2357228) (← links)
- WQO is decidable for factorial languages (Q2407108) (← links)
- Well-quasi-ordering \(H\)-contraction-free graphs (Q2413963) (← links)
- Certifying coloring algorithms for graphs without long induced paths (Q2414471) (← links)
- Weak and Nested Class Memory Automata (Q2799172) (← links)
- Petri Nets with Structured Data (Q2941152) (← links)
- Bipartite induced subgraphs and well-quasi-ordering (Q3018076) (← links)
- On the Verification of Timed Ad Hoc Networks (Q3172855) (← links)
- Recent Progress on Well-Quasi-ordering Graphs (Q3295151) (← links)
- (Q3384884) (← links)
- Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs (Q3656858) (← links)
- (Q4625695) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- Labelled well-quasi-order for permutation classes (Q5051473) (← links)
- Induced minors and well-quasi-ordering (Q5890902) (← links)
- Clique-width and well-quasi-ordering of triangle-free graph classes (Q5918202) (← links)
- WQO dichotomy for 3-graphs (Q5919047) (← links)