Berge trigraphs
From MaRDI portal
Recommendations
Cited in
(29)- Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- Stable sets in \(\{\mathrm{ISK4,wheel}\}\)-free graphs
- The P versus NP-complete dichotomy of some challenging problems in graph theory
- The sandwich problem for decompositions and almost monotone properties
- The saturation number of induced subposets of the Boolean lattice
- On some graph classes related to perfect graphs: a survey
- The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem
- On the linear extension complexity of stable set polytopes for perfect graphs
- Detecting 2-joins faster
- A Berge-keeping operation for graphs
- Decomposing Berge graphs and detecting balanced skew partitions
- Recognizing Berge graphs
- Graph partitions with prescribed patterns
- Clique-stable set separation in perfect graphs with no balanced skew-partitions
- Perfect graphs with no balanced skew-partition are 2-clique-colorable
- Colourings, homomorphisms, and partitions of transitive digraphs
- On the structure of self-complementary graphs
- Colouring perfect graphs with bounded clique number
- Induced saturation number
- Coloring perfect graphs with no balanced skew-partitions
- Graph classes and forbidden patterns on three vertices
- Induced saturation of the poset 2C₂
- Even pairs in Berge graphs with no balanced skew-partitions
- Perfect graphs involving semitotal and semipaired domination
- Combinatorial optimization with 2-joins
- The structure of bull-free graphs I -- three-edge-paths with centers and anticenters
- The strong perfect graph theorem
- Decomposing Berge graphs containing no proper wheel, long prism or their complements
This page was built for publication: Berge trigraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5487777)
