Pages that link to "Item:Q2448891"

The following pages link to Maximization coloring problems on graphs with few \(P_4\) (Q2448891):

Displaying 12 items.

• Restricted coloring problems on graphs with few \(P_4\)'s (Q490171) (← links)
• Graphs with few \(P_4\)'s under the convexity of paths of order three (Q491593) (← links)
• On the \(b\)-coloring of \(P_{4}\)-tidy graphs (Q617902) (← links)
• On the minimum sum coloring of \(P_4\)-sparse graphs (Q742570) (← links)
• On the Grundy number of graphs with few \(P_4\)'s (Q1759824) (← links)
• On the Grundy and \(b\)-chromatic numbers of a graph (Q1949739) (← links)
• Spy game: FPT-algorithm, hardness and graph products (Q2672629) (← links)
• Spy game: FPT-algorithm and results on graph products (Q2695339) (← links)
• Grundy number on \(P_4\)-classes (Q2840510) (← links)
• Restricted coloring problems on graphs with few \(P'_4s\) (Q2840684) (← links)
• The 3-Colorability Problem on Graphs with Maximum Degree Four (Q4429678) (← links)
• \(b\)-coloring parameterized by clique-width (Q6614620) (← links)