Generalized perfect graphs: Characterizations and inversion
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3882470 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3470444 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A characterization of perfect graphs
- Betweenness, orders and interval graphs
- Generalized perfect graphs: Characterizations and inversion
- Graph theory
- Graphical properties related to minimal imperfection
- Normal hypergraphs and the perfect graph conjecture
- On Partitioning Planar Graphs
- On generalized graph colorings
- On generalized perfect graphs: Bounded degree and bounded edge perfection
- Perfect zero–one matrices
- The Strong Perfect Graph Conjecture for Planar Graphs
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- The validity of the strong perfect-graph conjecture for \((K_4-e)\)-free graphs
Cited in
(9)- A generalization of perfect graphs?i-perfect graphs
- Generalized perfect graphs: Characterizations and inversion
- On generalized perfect graphs: Bounded degree and bounded edge perfection
- On clique-inverse graphs of graphs with bounded clique number
- scientific article; zbMATH DE number 14977 (Why is no real title available?)
- Perfect coloring and linearly χ-boundP6-free graphs
- On a perfect problem
- Generalized inverses in graph theory
- Lagrangian-perfect hypergraphs
This page was built for publication: Generalized perfect graphs: Characterizations and inversion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894378)