Pages that link to "Item:Q1159679"

The following pages link to Induced subtrees in graphs of large chromatic number (Q1159679):

Displaying 34 items.

• Induced subgraphs of graphs with large chromatic number. I. Odd holes (Q326809) (← links)
• Substitution and \(\chi\)-boundedness (Q461725) (← links)
• Induced colorful trees and paths in large chromatic graphs (Q504985) (← links)
• Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree (Q512863) (← links)
• First-fit coloring of bounded tolerance graphs (Q531602) (← links)
• Trees in greedy colorings of hypergraphs (Q616002) (← links)
• Large induced trees in \(K_r\)-free graphs (Q1003853) (← links)
• On the combinatorial problems which I would most like to see solved (Q1164626) (← links)
• Colorful induced subgraphs (Q1197025) (← links)
• Induced cycles and chromatic number (Q1306304) (← links)
• Classes of graphs that exclude a tree and a clique and are not vertex Ramsey (Q1375696) (← links)
• Induced subgraphs of graphs with large chromatic number. XI. Orientations (Q1633601) (← links)
• A note on chromatic number and induced odd cycles (Q1676794) (← links)
• Chromatic number and subtrees of graphs (Q1692708) (← links)
• Characterization of forbidden subgraphs for bounded star chromatic number (Q1712503) (← links)
• Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
• Applications of hypergraph coloring to coloring graphs not inducing certain trees (Q1916109) (← links)
• Induced subgraphs of graphs with large chromatic number. XIII. New brooms (Q2011144) (← links)
• Structure and colour in triangle-free graphs (Q2034076) (← links)
• On lower bounds for the chromatic number in terms of vertex degree (Q2275368) (← links)
• Packing trees into \(n\)-chromatic graphs (Q2442277) (← links)
• The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices (Q2662887) (← links)
• A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
• Radius two trees specify χ‐bounded classes (Q4284098) (← links)
• Radius two trees specify χ‐bounded classes (Q4309985) (← links)
• On induced colourful paths in triangle-free graphs (Q5915804) (← links)
• Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree (Q6046682) (← 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)
• A note on the Gyárfás-Sumner conjecture (Q6121918) (← 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)
• A Ramsey–Turán theory for tilings in graphs (Q6185051) (← links)
• Graphs of large chromatic number (Q6198641) (← links)