Completeness for intersection classes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 653261 (Why is no real title available?)
- A characterisation of rigid circuit graphs
- A characterization of perfect graphs
- Coloring a Family of Circular Arcs
- Families of graphs complete for the strong perfect graph Conjecture
- Graphical properties related to minimal imperfection
- Intersection graphs of paths in a tree
- Interval graphs and related topics
- No antitwins in minimal imperfect graphs
- Representation of a finite graph by a set of intervals on the real line
- The Strong Perfect Graph Conjecture for Planar Graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
Cited in
(7)- Intersection graphs of pseudosegments: chordal graphs
- Chordal Graphs as Intersection Graphs of Pseudosegments
- scientific article; zbMATH DE number 66762 (Why is no real title available?)
- On the structure of hereditary classes of graphs
- Completeness of cocompletions
- On economical set representations of graphs
- Set-Theoretic Complete Intersections
This page was built for publication: Completeness for intersection classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584399)