The recognition of triangle graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4063148 (Why is no real title available?)
- scientific article; zbMATH DE number 1554936 (Why is no real title available?)
- scientific article; zbMATH DE number 2117210 (Why is no real title available?)
- scientific article; zbMATH DE number 2197877 (Why is no real title available?)
- A recognition algorithm for orders of interval dimension two
- An intersection model for multitolerance graphs: efficient algorithms and hierarchy
- Connected domination and dominating clique in trapezoid graphs
- Edge and vertex intersection of paths in a tree
- Efficient graph representations
- Graph Classes: A Survey
- Linear-Interval Dimension and PI Orders
- Modular decomposition and transitive orientation
- On the 2-Chain Subgraph Cover and Related Problems
- On the complexity of recognizing perfectly orderable graphs
- Proper and unit bitolerance orders and graphs
- Proper and unit tolerance graphs
- Split semiorders
- The complexity of comparability graph recognition and coloring
- The recognition of tolerance and bounded tolerance graphs
- Topics in Intersection Graph Theory
- Trapezoid graphs and generalizations, geometry and algorithms
- Trapezoid graphs and their coloring
- Trapezoid order classification
- Triangulating multitolerance graphs
- Vertex splitting and the recognition of trapezoid graphs
Cited in
(13)- The recognition of triangle graphs
- Algorithms and complexity of \(s\)-club cluster vertex deletion
- Vertex splitting and the recognition of trapezoid graphs
- The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial
- Extended Learning Graphs for Triangle Finding
- Recognition of triangles by covariogram
- The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial
- On the hardness of recognizing triangular line graphs
- A linear-time algorithm for maximum-cardinality matching on cocomparability graphs
- scientific article; zbMATH DE number 1554936 (Why is no real title available?)
- Hardness and algorithms for variants of line graphs of directed graphs
- Recognizing triangulated Cartesian graph products
- A recognition algorithm for simple-triangle graphs
This page was built for publication: The recognition of triangle graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q441856)