Pages that link to "Item:Q1569067"

The following pages link to A simple competitive graph coloring algorithm (Q1569067):

Displaying 50 items.

• Asymmetric coloring games on incomparability graphs (Q324375) (← links)
• Game chromatic number of graphs with locally bounded number of cycles (Q407532) (← links)
• Coloring games on squares of graphs (Q408174) (← links)
• Adapted game colouring of graphs (Q412230) (← links)
• The game \(L(d,1)\)-labeling problem of graphs (Q456896) (← links)
• Indicated coloring of matroids (Q477356) (← links)
• The game Grundy indices of graphs (Q498433) (← links)
• The incidence game chromatic number of paths and subgraphs of wheels (Q534326) (← links)
• The game chromatic index of wheels (Q643001) (← links)
• 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)
• Generalised game colouring of graphs (Q878606) (← links)
• The relaxed game chromatic index of \(k\)-degenerate graphs (Q879391) (← links)
• The relaxed edge-coloring game and \(k\)-degenerate graphs (Q890010) (← links)
• Note on the game colouring number of powers of graphs (Q907829) (← links)
• Activation strategy for asymmetric marking games (Q925014) (← links)
• A note on the game chromatic index of graphs (Q937247) (← links)
• The 6-relaxed game chromatic number of outerplanar graphs (Q998330) (← links)
• Relaxed very asymmetric coloring games (Q1011775) (← links)
• Game-perfect graphs (Q1014302) (← links)
• Lightness of digraphs in surfaces and directed game chromatic number (Q1025549) (← links)
• Colouring games on outerplanar graphs and trees (Q1025941) (← links)
• Activation strategy for relaxed asymmetric coloring games (Q1025957) (← links)
• Generalization of transitive fraternal augmentations for directed graphs and its applications (Q1043997) (← links)
• Colouring graphs with bounded generalized colouring number (Q1045038) (← links)
• A simple competitive graph coloring algorithm. II. (Q1425110) (← links)
• Chromatic numbers of exact distance graphs (Q1633747) (← links)
• The game coloring number of planar graphs with a specific girth (Q1743687) (← links)
• Complete multipartite graphs and the relaxed coloring game (Q1757865) (← links)
• Relaxed game chromatic number of trees and outerplanar graphs (Q1827712) (← links)
• A simple competitive graph coloring algorithm. III (Q1880795) (← links)
• Game-perfect digraphs (Q1935960) (← links)
• The game chromatic number and the game colouring number of classes of oriented cactuses (Q1944077) (← links)
• The strong game colouring number of directed graphs (Q1945951) (← links)
• The game Grundy number of graphs (Q1956234) (← links)
• The game coloring number of planar graphs with a given girth (Q2017053) (← links)
• The incidence game chromatic number of \((a,d)\)-decomposable graphs (Q2018537) (← links)
• Autotopism stabilized colouring games on rook's graphs (Q2026339) (← links)
• On coloring numbers of graph powers (Q2174571) (← links)
• A connected version of the graph coloring game (Q2192130) (← links)
• Uniform orderings for generalized coloring numbers (Q2225419) (← links)
• On the weak 2-coloring number of planar graphs (Q2237215) (← links)
• On the game chromatic number of splitting graphs of path and cycle (Q2330094) (← links)
• Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs (Q2427530) (← links)
• Refined activation strategy for the marking game (Q2464148) (← links)
• The game of arboricity (Q2476280) (← links)
• Weak acyclic coloring and asymmetric coloring games (Q2488942) (← links)
• Very asymmetric marking games (Q2490427) (← links)
• The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\) (Q2492207) (← links)
• A note on the connected game coloring number (Q2700603) (← links)