The following pages link to (Q4063176):
Displaying 50 items.
- Restricted frame graphs and a conjecture of Scott (Q252837) (← links)
- Proper orientation of cacti (Q301589) (← links)
- Induced subgraphs of graphs with large chromatic number. I. Odd holes (Q326809) (← links)
- Extending the Gyárfás-Sumner conjecture (Q401488) (← links)
- Graphs of separability at most 2 (Q415268) (← links)
- Induced colorful trees and paths in large chromatic graphs (Q504985) (← links)
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors (Q505914) (← links)
- First-fit coloring of bounded tolerance graphs (Q531602) (← links)
- Large induced trees in \(K_r\)-free graphs (Q1003853) (← links)
- Applications of edge coloring of multigraphs to vertex coloring of graphs (Q1121898) (← links)
- Induced subtrees in graphs of large chromatic number (Q1159679) (← links)
- Induced cycles and chromatic number (Q1306304) (← links)
- 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. (Q1427186) (← links)
- Triangle-free graphs and forbidden subgraphs (Q1613361) (← 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)
- 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)
- Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings (Q2040019) (← links)
- Pure pairs. II: Excluding all subdivisions of a graph (Q2043764) (← links)
- Digraphs with all induced directed cycles of the same length are not \(\vec{\chi}\)-bounded (Q2094868) (← links)
- From \(\chi\)- to \(\chi_p\)-bounded classes (Q2099414) (← links)
- Fractional cocoloring of graphs (Q2117529) (← links)
- Chordal directed graphs are not \(\chi\)-bounded (Q2138574) (← links)
- On the chromatic number of some \(P_5\)-free graphs (Q2144602) (← links)
- 2-divisibility of some odd hole free graphs (Q2155661) (← links)
- Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case (Q2363699) (← links)
- Caterpillars in Erdős-Hajnal (Q2421547) (← links)
- Graph classes with linear Ramsey numbers (Q2659214) (← links)
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs (Q2664559) (← 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)
- $(2P_2,K_4)$-Free Graphs are 4-Colorable (Q5232143) (← 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)
- Coloring of some crown-free graphs (Q6063283) (← links)
- On coloring digraphs with forbidden induced subgraphs (Q6074583) (← links)
- An optimal χ‐bound for (P6, diamond)‐free graphs (Q6080859) (← links)
- Polynomial bounds for chromatic number VII. Disjoint holes (Q6081574) (← links)
- Coloring graphs without induced \(P_5\) or \(K_5-e\) (Q6089566) (← links)
- A note on the Gyárfás-Sumner conjecture (Q6121918) (← links)
- Disjointness graphs of short polygonal chains (Q6144392) (← 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)
- Hitting all maximum stable sets in \(P_5\)-free graphs (Q6187345) (← links)
