Pages that link to "Item:Q5232874"

The following pages link to A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS (Q5232874):

Displaying 12 items.

• On the structure of (\(P_{5}\),\,gem)-free graphs (Q1764802) (← links)
• Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width (Q1764808) (← links)
• On the chromatic number of some \(P_5\)-free graphs (Q2144602) (← links)
• A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs (Q2701401) (← links)
• Perfect coloring and linearly χ-boundP6-free graphs (Q3437005) (← links)
• Colouring graphs with no induced six-vertex path or diamond (Q5925590) (← links)
• Colouring graphs with no induced six-vertex path or diamond (Q5972261) (← links)
• On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques (Q6084676) (← links)
• Divisibility and coloring of some \(P_5\)-free graphs (Q6124429) (← links)
• On the chromatic number of (P5,dart)-free graphs (Q6132236) (← links)
• Coloring graphs with no induced five‐vertex path or gem (Q6134643) (← links)
• Some results on \(k\)-critical \(P_5\)-free graphs (Q6157421) (← links)