Pages that link to "Item:Q279215"

The following pages link to Chromatic number of \(P_5\)-free graphs: Reed's conjecture (Q279215):

Displaying 17 items.

• On the chromatic number of \((P_{5},K_{2,t})\)-free graphs (Q510963) (← links)
• Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
• On the chromatic number of some \(P_5\)-free graphs (Q2144602) (← links)
• Classes of graphs with no long cycle as a vertex-minor are polynomially \(\chi\)-bounded (Q2284734) (← links)
• A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs (Q2701401) (← links)
• On the chromatic number of (P_{5},windmill)-free graphs (Q4690990) (← links)
• Spectral properties of cographs and<i>P</i>₅-free graphs (Q4967261) (← links)
• THE CHROMATIC NUMBER OF -FREE GRAPHS (Q6046762) (← links)
• Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)
• A note on Reed's conjecture for triangle-free graphs (Q6080563) (← links)
• On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques (Q6084676) (← links)
• Large cliques in graphs with high chromatic number (Q6091811) (← links)
• Divisibility and coloring of some \(P_5\)-free graphs (Q6124429) (← links)
• On the chromatic number of (P5,dart)-free graphs (Q6132236) (← links)
• Coloring graphs with no induced five‐vertex path or gem (Q6134643) (← links)
• Structure of some \(( P_7, C_4)\)-free graphs with application to colorings (Q6611001) (← links)
• The chromatic number of (\(P_5\), HVN)-free graphs (Q6639497) (← links)