Pages that link to "Item:Q1192946"

The following pages link to The complexity of some graph colouring problems (Q1192946):

Displaying 36 items.

• The complexity of changing colourings with bounded maximum degree (Q407523) (← links)
• On the complexity of the flow coloring problem (Q499367) (← links)
• Critically paintable, choosable or colorable graphs (Q713164) (← links)
• Some colouring problems for Paley graphs (Q817760) (← links)
• Complexity issues in color-preserving graph embeddings (Q846361) (← links)
• The number of \(k\)-colorings of a graph on a fixed surface (Q856865) (← links)
• Complexity of two coloring problems in cubic planar bipartite mixed graphs (Q968180) (← links)
• The vertex coloring problem and its generalizations (Q1022440) (← links)
• Worst case analysis of a graph coloring algorithm (Q1066156) (← links)
• The complexity of colouring problems on dense graphs (Q1079363) (← links)
• The complexity of multicolouring (Q1113919) (← links)
• The complexity of \(G\)-free colourability (Q1356726) (← links)
• The complexity of the \(T\)-coloring problem for graphs with small degree (Q1406032) (← links)
• The complexity of \(H\)-colouring of bounded degree graphs (Q1579552) (← links)
• On solving the queen graph coloring problem (Q1642700) (← links)
• Complexity of Grundy coloring and its variants (Q1752449) (← links)
• On the complexity of cd-coloring of graphs (Q2181255) (← links)
• The complexity of counting edge colorings for simple graphs (Q2232603) (← links)
• On the complexity of \(k\)-rainbow cycle colouring problems (Q2422742) (← links)
• From combinatorial problems to graph colorings (Q2927762) (← links)
• NP-Completeness of Spreading Colored Points (Q3066143) (← links)
• Filling the complexity gaps for colouring planar and bounded degree graphs (Q3299212) (← links)
• (Q3515552) (← links)
• Complexity of clique-coloring odd-hole-free graphs (Q3652547) (← links)
• (Q3766875) (← links)
• ON THE COMPLEXITY OF SOME COLORING GAMES (Q3988839) (← links)
• (Q4247451) (← links)
• (Q4401989) (← links)
• (Q4414494) (← links)
• A Complexity Dichotomy for the Coloring of Sparse Graphs (Q4920652) (← links)
• (Q4947488) (← links)
• An Average Case NP-complete Graph Colouring Problem (Q4962593) (← links)
• A study of the boundary graph classes for colorability problems (Q5263795) (← links)
• (Q5866345) (← links)
• The complexity of grid coloring (Q6109067) (← links)
• Complexity of total dominator coloring in graphs (Q6184152) (← links)