Forbidden ordered subgraph vs. forbidden subgraph characterizations of graph classes
From MaRDI portal
Publication:4229261
DOI10.1002/(SICI)1097-0118(199902)30:2%3C71::AID-JGT1%3E3.0.CO;2-GzbMATH Open0918.05084OpenAlexW4240098947MaRDI QIDQ4229261FDOQ4229261
Authors: Mark Ginn 
Publication date: 19 August 1999
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199902)30:2%3C71::aid-jgt1%3E3.0.co;2-g
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 (6)
- Naturally submodular digraphs and forbidden digraph configurations
- A forbidden subgraph characterization of some graph classes using betweenness axioms
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
- On forbidden subdivision characterizations of graph classes
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
