Forbidden ordered subgraph vs. forbidden subgraph characterizations of graph classes
From MaRDI portal
Recommendations
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
- Two forbidden induced subgraphs and well-quasi-ordering
- scientific article; zbMATH DE number 468640
- Ordering without forbidden patterns
- Chromatic number of ordered graphs with forbidden ordered subgraphs
- Isomorphism on subgraph-closed graph classes: a complexity dichotomy and intermediate graph classes
- Saturated graphs with minimal number of edges
- An attractive class of bipartite graphs
- Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions
Cites work
Cited in
(14)- Finiteness theorems for graphs and posets obtained by compositions
- A forbidden subgraph characterization of some graph classes using betweenness axioms
- Naturally submodular digraphs and forbidden digraph configurations
- Describing hereditary properties by forbidden circular orderings
- Forbidden induced subgraphs
- On characterizations by nice forbidding sets
- Ordering without forbidden patterns
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
- scientific article; zbMATH DE number 4144022 (Why is no real title available?)
- scientific article; zbMATH DE number 15355 (Why is no real title available?)
- On the computational complexity of ordered subgraph recognition
- Graph classes and forbidden patterns on three vertices
- Tree-layout based graph classes: proper chordal graphs
- On forbidden subdivision characterizations of graph classes
This page was built for publication: Forbidden ordered subgraph vs. forbidden subgraph characterizations of graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4229261)
