Pages that link to "Item:Q1939592"

The following pages link to Triangle-free \(2P_3\)-free graphs are 4-colorable (Q1939592):

Displaying 13 items.

• Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time (Q417995) (← links)
• Triangle-free graphs and forbidden subgraphs (Q1613361) (← links)
• Chromatic number of ISK4-free graphs (Q1696549) (← links)
• Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case (Q2363699) (← links)
• Triangle-free graphs of tree-width \(t\) are \(\lceil (t+3)/2 \rceil\)-colorable (Q2403691) (← links)
• On the chromatic number of (\(P_6\), diamond)-free graphs (Q2413634) (← links)
• Triangle-free graphs without forbidden subgraphs (Q2741324) (← links)
• A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
• Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains (Q3177443) (← links)
• $(2P_2,K_4)$-Free Graphs are 4-Colorable (Q5232143) (← links)
• Triangle‐free graphs that do not contain an induced subdivision of <i>K</i>₄ are 3‐colorable (Q5241606) (← links)
• Improved bounds on the chromatic number of (\(P_5\), flag)-free graphs (Q6098088) (← links)
• Coloring (\(P_5\), kite)-free graphs with small cliques (Q6180573) (← links)