Pages that link to "Item:Q5903942"

The following pages link to On the strong perfect graph conjecture (Q5903942):

Displaying 43 items.

• Coloring perfect \((K_ 4\)-e)-free graphs (Q1071025) (← links)
• A note on perfect graphs (Q1084108) (← links)
• A semi-strong perfect graph theorem (Q1104341) (← links)
• Locally perfect graphs (Q1105623) (← links)
• No antitwins in minimal imperfect graphs (Q1107542) (← links)
• The strong perfect graph conjecture for pan-free graphs (Q1112848) (← links)
• All variations on perfectly orderable graphs (Q1114703) (← links)
• On the \(P_ 4\)-structure of perfect graphs. III: Partner decompositions (Q1123219) (← links)
• Some properties of minimal imperfect graphs (Q1126292) (← links)
• On the complexity of testing for odd holes and induced odd paths (Q1175980) (← links)
• Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets (Q1197003) (← links)
• The strong perfect graph conjecture holds for diamonded odd cycle-free graphs (Q1208345) (← links)
• Articulation sets in linear perfect matrices. II: The wheel theorem and clique articulations (Q1208351) (← links)
• On minimal imperfect graphs without induced \(P_5\) (Q1293187) (← links)
• On Tucker vertices of graphs (Q1301659) (← links)
• Normal fraternally orientable graphs satisfy the strong perfect graph conjecture (Q1313857) (← links)
• New classes of Berge perfect graphs (Q1332433) (← links)
• Perfect graphs with no \(P_ 5\) and no \(K_ 5\) (Q1334944) (← links)
• Quasi-parity and perfect graphs (Q1349738) (← links)
• Chair-free Berge graphs are perfect (Q1376074) (← links)
• On the closure of graphs under substitution (Q1377871) (← links)
• Progress on perfect graphs (Q1403295) (← links)
• Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs (Q1405122) (← links)
• On the \(P_ 4\)-structure of perfect graphs. IV: Partner graphs (Q1812828) (← links)
• A generalization of Chvátal's star-cutset lemma (Q1813708) (← links)
• Two conjectures equivalent to the perfect graph conjecture (Q1850071) (← links)
• A transformation which preserves the clique number (Q1850572) (← links)
• Strongly perfect infinite graphs (Q1895072) (← links)
• A characterization of some graph classes with no long holes (Q1898735) (← links)
• A new class of perfect Hoàng graphs (Q1901048) (← links)
• Even pairs and the strong perfect graph conjecture (Q1918559) (← links)
• On the \(P_ 4\)-structure of perfect graphs. V: Overlap graphs (Q1924145) (← links)
• Perfect graphs (Q2822594) (← links)
• (Q3222224) (← links)
• Perfect coloring and linearly χ-boundP6-free graphs (Q3437005) (← links)
• On a Class of <i>P</i> ₅ -Free Graphs (Q3476848) (← links)
• Families of graphs complete for the strong perfect graph Conjecture (Q3760583) (← links)
• On the two‐edge‐colorings of perfect graphs (Q4326544) (← links)
• Recursive generation of partitionable graphs (Q4798118) (← links)
• Structure of super strongly perfect graphs (Q5101913) (← links)
• Cycle-perfect graphs are perfect (Q5284580) (← links)
• On Tucker's proof of the strong perfect graph conjecture for \((K_4-e)\)-free graphs (Q5937451) (← links)
• On the divisibility of graphs (Q5957752) (← links)