Pages that link to "Item:Q1733849"

The following pages link to Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849):

Displaying 31 items.

• Chromatic bounds for the subclasses of \(pK_2\)-free graphs (Q831732) (← links)
• A better upper bound on the chromatic number of (cap, even-hole)-free graphs (Q1981707) (← links)
• Borodin-Kostochka's conjecture on \((P_5,C_4)\)-free graphs (Q2053188) (← links)
• Coloring of \((P_5, 4\)-wheel)-free graphs (Q2113346) (← links)
• Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4 (Q2124634) (← links)
• Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs (Q2138579) (← links)
• On the chromatic number of some \(P_5\)-free graphs (Q2144602) (← links)
• Coloring graph classes with no induced fork via perfect divisibility (Q2161205) (← links)
• Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions (Q2166229) (← links)
• Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs (Q2222949) (← links)
• The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices (Q2662887) (← links)
• Polynomial bounds for chromatic number VI. Adding a four-vertex path (Q2701011) (← links)
• A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs (Q2701401) (← links)
• On graphs with no induced five‐vertex path or paraglider (Q6055942) (← links)
• Polynomial bounds for chromatic number II: Excluding a star‐forest (Q6057629) (← links)
• Polynomial bounds for chromatic number. III. Excluding a double star (Q6057630) (← links)
• Coloring of some crown-free graphs (Q6063283) (← links)
• An optimal χ‐bound for (P6, diamond)‐free graphs (Q6080859) (← links)
• Polynomial bounds for chromatic number VII. Disjoint holes (Q6081574) (← links)
• On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques (Q6084676) (← links)
• Coloring graphs without induced \(P_5\) or \(K_5-e\) (Q6089566) (← links)
• Improved bounds on the chromatic number of (\(P_5\), flag)-free graphs (Q6098088) (← links)
• Bounds for the chromatic number of some \(pK_2\)-free graphs (Q6103479) (← links)
• On the chromatic number of (P5,dart)-free graphs (Q6132236) (← links)
• Coloring graphs with no induced five‐vertex path or gem (Q6134643) (← links)
• Optimal chromatic bound for (P2+P3,P2+P3¯ ${P}_{2}+{P}_{3},\bar{{P}_{2}+{P}_{3}}$)‐free graphs (Q6143379) (← links)
• Coloring \(\{ P 2 \cup P 3 , \operatorname{house} \} \)-free graphs with \(\Delta - 1\) colors (Q6143841) (← links)
• Polynomial bounds for chromatic number. V: Excluding a tree of radius two and a complete multipartite graph (Q6144408) (← links)
• Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs (Q6170792) (← links)
• Coloring (\(P_5\), kite)-free graphs with small cliques (Q6180573) (← links)
• Near optimal colourability on hereditary graph families (Q6196836) (← links)