Generalized perfect graphs: Characterizations and inversion
From MaRDI portal
Publication:1894378
DOI10.1016/0166-218X(94)00066-MzbMath0833.05064OpenAlexW2055939684MaRDI QIDQ1894378
Publication date: 11 March 1996
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(94)00066-m
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (2)
Generalized perfect graphs: Characterizations and inversion ⋮ On generalized perfect graphs: Bounded degree and bounded edge perfection
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On generalized perfect graphs: Bounded degree and bounded edge perfection
- The validity of the strong perfect-graph conjecture for \((K_4-e)\)-free graphs
- Graphical properties related to minimal imperfection
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- Generalized perfect graphs: Characterizations and inversion
- Betweenness, orders and interval graphs
- A characterization of perfect graphs
- Normal hypergraphs and the perfect graph conjecture
- On generalized graph colorings
- Perfect zero–one matrices
- On Partitioning Planar Graphs
- The Strong Perfect Graph Conjecture for Planar Graphs
This page was built for publication: Generalized perfect graphs: Characterizations and inversion
