On the computational complexity of ordered subgraph recognition
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 53191 (Why is no real title available?)
- Edge-Disjoint Spanning Trees of Finite Graphs
- Four classes of perfectly orderable graphs
- Graphs with linearly bounded Ramsey numbers
- Incidence matrices and interval graphs
- On rigid circuit graphs
- On the complexity of recognizing perfectly orderable graphs
- Probability Inequalities for Sums of Bounded Random Variables
- Some simplified NP-complete graph problems
- The NP-completeness column: An ongoing guide
- The Ramsey Property for Families of Graphs Which Exclude a Given Graph
- Topics on perfect graphs
- Total Ordering Problem
- Transitive Orientation of Graphs and Identification of Permutation Graphs
Cited in
(16)- The complexity of regular subgraph recognition
- scientific article; zbMATH DE number 4133491 (Why is no real title available?)
- scientific article; zbMATH DE number 2044949 (Why is no real title available?)
- Recognizing Bellman–Ford-Orderable Graphs
- Graph classes and forbidden patterns on three vertices
- Recognizing interval bigraphs by forbidden patterns
- On the complexity of partial order properties
- Computing an evolutionary ordering is hard
- On computational aspects of ordered matching problems
- Proper and unit bitolerance orders and graphs
- On the complexity of diagram testing
- Ordering without forbidden patterns
- Tree-layout based graph classes: proper chordal graphs
- Forbidden tournaments and the orientation completion problem
- On grounded -graphs and their relatives
- On the complexity of recognizing a class of perfectly orderable graphs
This page was built for publication: On the computational complexity of ordered subgraph recognition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4851929)
