Pages that link to "Item:Q326809"

The following pages link to Induced subgraphs of graphs with large chromatic number. I. Odd holes (Q326809):

Displaying 36 items.

• Restricted frame graphs and a conjecture of Scott (Q252837) (← links)
• Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors (Q505914) (← links)
• Induced subgraphs of graphs with large chromatic number. III: Long holes (Q722311) (← links)
• Induced subgraphs of graphs with large chromatic number. IV: Consecutive holes (Q723885) (← links)
• A note on chromatic number and induced odd cycles (Q1676794) (← links)
• Some problems on induced subgraphs (Q1693168) (← links)
• Characterization of forbidden subgraphs for bounded star chromatic number (Q1712503) (← links)
• A note on chromatic number of (cap, even hole)-free graphs (Q1712540) (← links)
• Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
• A better upper bound on the chromatic number of (cap, even-hole)-free graphs (Q1981707) (← links)
• Induced subgraphs of graphs with large chromatic number. VII: Gyárfás' complementation conjecture (Q1985444) (← links)
• Detecting a long odd hole (Q2035985) (← 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)
• A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number (Q2101164) (← links)
• A note on a conjecture of Wu, Xu and Xu (Q2109109) (← links)
• Coloring of \((P_5, 4\)-wheel)-free graphs (Q2113346) (← links)
• 2-divisibility of some odd hole free graphs (Q2155661) (← links)
• Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions (Q2166229) (← links)
• Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes (Q2284726) (← links)
• Colouring exact distance graphs of chordal graphs (Q2305897) (← links)
• Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case (Q2363699) (← links)
• Triangle packings and transversals of some \(K_{4}\)-free graphs (Q2413632) (← links)
• A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs (Q2701401) (← links)
• Square-Free Graphs with No Six-Vertex Induced Path (Q5232134) (← links)
• THE CHROMATIC NUMBER OF -FREE GRAPHS (Q6046762) (← links)
• The chromatic number of {ISK4, diamond, bowtie}‐free graphs (Q6055409) (← links)
• On graphs with no induced five‐vertex path or paraglider (Q6055942) (← links)
• Some remarks on graphs with no induced subdivision of \(K_4\) (Q6064854) (← links)
• Induced odd cycle packing number, independent sets, and chromatic number (Q6074594) (← links)
• An optimal χ‐bound for (P6, diamond)‐free graphs (Q6080859) (← links)
• Problems close to my heart (Q6116410) (← links)
• Divisibility and coloring of some \(P_5\)-free graphs (Q6124429) (← links)
• Coloring \(\{ P 2 \cup P 3 , \operatorname{house} \} \)-free graphs with \(\Delta - 1\) colors (Q6143841) (← links)
• Borodin-Kostochka conjecture holds for odd-hole-free graphs (Q6154380) (← links)
• Graphs of large chromatic number (Q6198641) (← links)