Pages that link to "Item:Q1880795"

The following pages link to A simple competitive graph coloring algorithm. III (Q1880795):

Displaying 20 items.

• On the relaxed colouring game and the unilateral colouring game (Q742610) (← links)
• Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers (Q819816) (← links)
• The relaxed game chromatic index of \(k\)-degenerate graphs (Q879391) (← links)
• The relaxed edge-coloring game and \(k\)-degenerate graphs (Q890010) (← links)
• The relaxed game chromatic number of graphs with cut-vertices (Q897291) (← links)
• Activation strategy for asymmetric marking games (Q925014) (← links)
• The 6-relaxed game chromatic number of outerplanar graphs (Q998330) (← links)
• Relaxed very asymmetric coloring games (Q1011775) (← links)
• Game-perfect graphs (Q1014302) (← links)
• Colouring games on outerplanar graphs and trees (Q1025941) (← links)
• Activation strategy for relaxed asymmetric coloring games (Q1025957) (← links)
• A simple competitive graph coloring algorithm. II. (Q1425110) (← links)
• The game coloring number of planar graphs with a specific girth (Q1743687) (← links)
• Complete multipartite graphs and the relaxed coloring game (Q1757865) (← links)
• Game-perfect digraphs (Q1935960) (← links)
• The game Grundy number of graphs (Q1956234) (← links)
• Refined activation strategy for the marking game (Q2464148) (← links)
• (Q3138289) (← links)
• Game coloring the Cartesian product of graphs (Q3605153) (← links)
• Introduction to competitive graph coloring (Q6599238) (← links)