Forbidden ordered subgraph vs. forbidden subgraph characterizations of graph classes

DOI10.1002/(SICI)1097-0118(199902)30:2%3C71::AID-JGT1%3E3.0.CO;2-GzbMATH Open0918.05084OpenAlexW4240098947MaRDI QIDQ4229261FDOQ4229261

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

zbMATH Keywords

ordered graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Cites Work

• Graph Theory and Probability

Cited In (4)

• 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
• Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Saturated graphs with minimal number of edges 👍 👎
• Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs 👍 👎
• Two forbidden induced subgraphs and well-quasi-ordering 👍 👎
• Graph isomorphism for graph classes characterized by two forbidden induced subgraphs 👍 👎
• Chromatic number of ordered graphs with forbidden ordered subgraphs 👍 👎
• An attractive class of bipartite graphs 👍 👎
• Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes 👍 👎
• Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions 👍 👎
• Ordering without Forbidden Patterns 👍 👎

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)