Pages that link to "Item:Q1150627"

The following pages link to A bound on the chromatic number of graphs without certain induced subgraphs (Q1150627):

Displaying 31 items.

• Vertex coloring of graphs with few obstructions (Q344868) (← links)
• Locally bounded coverings and factorial properties of graphs (Q412246) (← links)
• Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree (Q512863) (← links)
• Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
• Chromatic bounds for the subclasses of \(pK_2\)-free graphs (Q831732) (← links)
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree (Q912124) (← links)
• On the existence of two non-neighboring subgraphs in a graph (Q1078191) (← links)
• Maximum induced matchings in graphs (Q1363677) (← links)
• Triangle-free graphs and forbidden subgraphs (Q1613361) (← links)
• On the chromatic number of \(2 K_2\)-free graphs (Q1634757) (← links)
• Colouring of \((P_3 \cup P_2)\)-free graphs (Q1706425) (← links)
• Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
• Chromatic bounds for some classes of \(2 K_2\)-free graphs (Q1783621) (← links)
• Graphs with no induced \(C_ 4\) and \(2K_ 2\) (Q1801686) (← 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)
• The \(\varepsilon\)-\(t\)-net problem (Q2167320) (← links)
• Independence and matching number in graphs with maximum degree 4 (Q2439118) (← links)
• The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices (Q2662887) (← links)
• A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs (Q2701401) (← links)
• A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
• On the chromatic number of (P_{5},windmill)-free graphs (Q4690990) (← links)
• Polynomial bounds for chromatic number II: Excluding a star‐forest (Q6057629) (← links)
• Coloring of some crown-free graphs (Q6063283) (← links)
• An optimal χ‐bound for (P6, diamond)‐free graphs (Q6080859) (← links)
• On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques (Q6084676) (← links)
• Bounds for the chromatic number of some \(pK_2\)-free graphs (Q6103479) (← links)
• Signed Ramsey numbers (Q6144499) (← links)
• Hitting all maximum stable sets in \(P_5\)-free graphs (Q6187345) (← links)
• Near optimal colourability on hereditary graph families (Q6196836) (← links)