Pages that link to "Item:Q2407377"

The following pages link to Coloring graphs with forbidden minors (Q2407377):

Displaying 14 items.

• On colorability of graphs with forbidden minors along paths and circuits (Q533778) (← links)
• Rooted complete minors in line graphs with a Kempe coloring (Q1741595) (← links)
• The extremal function for Petersen minors (Q1748273) (← links)
• Excluding any graph as a minor allows a low tree-width 2-coloring (Q1826951) (← links)
• Connectivity and choosability of graphs with no \(K_t\) minor (Q2099418) (← links)
• Excluded checkerboard colourable ribbon graph minors (Q2144588) (← links)
• Some remarks on even-hole-free graphs (Q2161221) (← links)
• A note on Hadwiger's conjecture for \(W_5\)-free graphs with independence number two (Q2329179) (← links)
• Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor (Q2387186) (← links)
• The extremal function for \(K_{8}^{-}\) minors (Q2573648) (← links)
• Properties of 8-contraction-critical graphs with no \(K_7\) minor (Q2701012) (← links)
• Graphs with no K9= minor are 10‐colorable (Q5110672) (← links)
• Hadwiger's Conjecture for Graphs with Forbidden Holes (Q5348213) (← links)
• Improved lower bound for the list chromatic number of graphs with no <i>K_t</i> minor (Q5886353) (← links)