Pages that link to "Item:Q765203"

The following pages link to The structure of bull-free graphs II and III -- a summary (Q765203):

Displaying 25 items.

• Clique-stable set separation in perfect graphs with no balanced skew-partitions (Q267214) (← links)
• Total domination edge critical graphs with total domination number three and many dominating pairs (Q497305) (← links)
• Maximum weight independent sets in odd-hole-free graphs without dart or without bull (Q497314) (← links)
• Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey (Q498431) (← links)
• The complexity of partitioning into disjoint cliques and a triangle-free graph (Q516874) (← links)
• A polynomial Turing-kernel for weighted independent set in bull-free graphs (Q521799) (← links)
• Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
• The structure of bull-free graphs I -- three-edge-paths with centers and anticenters (Q765202) (← links)
• Improved FPT algorithms for weighted independent set in bull-free graphs (Q1685998) (← links)
• Maximum weight stable set in (\(P_7\), bull)-free graphs and (\(S_{1, 2, 3}\), bull)-free graphs (Q1709548) (← links)
• Partitioning \(H\)-free graphs of bounded diameter (Q2166756) (← links)
• The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs (Q2173431) (← links)
• The (theta, wheel)-free graphs. II: Structure theorem (Q2173432) (← links)
• On graphs with 2 trivial distance ideals (Q2174093) (← links)
• Graphs without five-vertex path and four-vertex cycle (Q2286127) (← links)
• Partitioning a graph into disjoint cliques and a triangle-free graph (Q2352776) (← links)
• Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable (Q2800540) (← links)
• Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs (Q2817880) (← links)
• The Structure of Bull-Free Perfect Graphs (Q2852609) (← links)
• Graphs of Separability at Most Two: Structural Characterizations and Their Consequences (Q3000517) (← links)
• The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs (Q3181049) (← links)
• Finding matching cuts in \(H\)-free graphs (Q6046951) (← links)
• Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
• Contracting to a longest path in H-free graphs (Q6065420) (← links)
• Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius (Q6614030) (← links)