Pages that link to "Item:Q2284726"

The following pages link to Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes (Q2284726):

Displaying 10 items.

• A note on chromatic number and induced odd cycles (Q1676794) (← 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)
• Detecting a long odd hole (Q2035985) (← links)
• Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings (Q2040019) (← links)
• The chromatic number of {ISK4, diamond, bowtie}‐free graphs (Q6055409) (← links)
• Finding a shortest even hole in polynomial time (Q6057650) (← links)
• Graphs of large chromatic number (Q6198641) (← links)
• Fractional coloring with local demands and applications to degree-sequence bounds on the independence number (Q6615757) (← links)