The following pages link to Berge trigraphs (Q5487777):
Displayed 23 items.
- Clique-stable set separation in perfect graphs with no balanced skew-partitions (Q267214) (← links)
- Colourings, homomorphisms, and partitions of transitive digraphs (Q338575) (← links)
- Colouring perfect graphs with bounded clique number (Q345123) (← links)
- Induced saturation number (Q456647) (← links)
- Coloring perfect graphs with no balanced skew-partitions (Q490982) (← links)
- Perfect graphs involving semitotal and semipaired domination (Q721925) (← links)
- Combinatorial optimization with 2-joins (Q765197) (← links)
- The structure of bull-free graphs I -- three-edge-paths with centers and anticenters (Q765202) (← links)
- Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs (Q1014826) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- Stable sets in \(\{\mathrm{ISK4,wheel}\}\)-free graphs (Q1709574) (← links)
- The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
- The sandwich problem for decompositions and almost monotone properties (Q1799213) (← links)
- The saturation number of induced subposets of the Boolean lattice (Q2012537) (← links)
- On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
- The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem (Q2255038) (← links)
- On the linear extension complexity of stable set polytopes for perfect graphs (Q2311370) (← links)
- Detecting 2-joins faster (Q2376790) (← links)
- Decomposing Berge graphs and detecting balanced skew partitions (Q2464161) (← links)
- Graph partitions with prescribed patterns (Q2509761) (← links)
- Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable (Q2800540) (← links)
- On the structure of self-complementary graphs (Q3439312) (← links)
- Graph Classes and Forbidden Patterns on Three Vertices (Q5855535) (← links)