The following pages link to (Q3932997):
Displaying 50 items.
- 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)
- 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)
- Trees in greedy colorings of hypergraphs (Q616002) (← links)
- Square-free graphs with no induced fork (Q831350) (← links)
- Large induced trees in \(K_r\)-free graphs (Q1003853) (← links)
- Applications of edge coloring of multigraphs to vertex coloring of graphs (Q1121898) (← links)
- Effective on-line coloring of \(P_ 5\)-free graphs (Q1180418) (← links)
- Colorful induced subgraphs (Q1197025) (← links)
- Induced cycles and chromatic number (Q1306304) (← links)
- Dominating subgraphs in graphs with some forbidden structures (Q1343259) (← links)
- Claw-free graphs---a survey (Q1356695) (← links)
- 3-colorability and forbidden subgraphs. I: Characterizing pairs (Q1422435) (← 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)
- Colouring squares of claw-free graphs (Q1689990) (← 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)
- On forbidden induced subgraphs for \(K_{1, 3}\)-free perfect graphs (Q1999727) (← links)
- Induced subgraphs of graphs with large chromatic number. XIII. New brooms (Q2011144) (← links)
- Extension of Gyárfás-Sumner conjecture to digraphs (Q2030749) (← links)
- Structure and colour in triangle-free graphs (Q2034076) (← links)
- The structure of claw-free binary matroids (Q2040015) (← 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)
- From \(\chi\)- to \(\chi_p\)-bounded classes (Q2099414) (← links)
- Fractional cocoloring of graphs (Q2117529) (← links)
- Chordal directed graphs are not \(\chi\)-bounded (Q2138574) (← 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)
- On indicated coloring of lexicographic product of graphs (Q2161277) (← links)
- Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions (Q2166229) (← links)
- Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case (Q2363699) (← links)
- Caterpillars in Erdős-Hajnal (Q2421547) (← links)
- Coloring graphs without short cycles and long induced paths (Q2440105) (← links)
- Graph classes with linear Ramsey numbers (Q2659214) (← links)
- The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices (Q2662887) (← links)
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs (Q2664559) (← links)
- Decomposing and colouring some locally semicomplete digraphs (Q2674564) (← 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)
- Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs (Q3181051) (← links)
- Colouring Squares of Claw-free Graphs (Q4625179) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
