Pages that link to "Item:Q4256107"

The following pages link to Game chromatic number of outerplanar graphs (Q4256107):

Displaying 50 items.

• The graph distance game and some graph operations (Q283692) (← links)
• Asymmetric coloring games on incomparability graphs (Q324375) (← links)
• Game chromatic number of graphs with locally bounded number of cycles (Q407532) (← links)
• Adapted game colouring of graphs (Q412230) (← links)
• The game \(L(d,1)\)-labeling problem of graphs (Q456896) (← links)
• The coloring game on planar graphs with large girth, by a result on sparse cactuses (Q512597) (← 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)
• The game chromatic number and the game colouring number of cactuses (Q845991) (← 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)
• The relaxed game chromatic number of graphs with cut-vertices (Q897291) (← links)
• The 6-relaxed game chromatic number of outerplanar graphs (Q998330) (← 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)
• Circular game chromatic number of graphs (Q1043981) (← links)
• Game colouring of the square of graphs (Q1043984) (← links)
• Asymmetric directed graph coloring games (Q1045076) (← links)
• A bound for the game chromatic number of graphs (Q1297403) (← links)
• The game coloring number of planar graphs (Q1305532) (← links)
• A simple competitive graph coloring algorithm. II. (Q1425110) (← links)
• A simple competitive graph coloring algorithm (Q1569067) (← links)
• The game coloring number of planar graphs with a specific girth (Q1743687) (← links)
• Relaxed game chromatic number of trees and outerplanar graphs (Q1827712) (← links)
• A simple competitive graph coloring algorithm. III (Q1880795) (← 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)
• The eternal game chromatic number of random graphs (Q2033931) (← links)
• Infinite chromatic games (Q2065775) (← links)
• Game chromatic number of strong product graphs (Q2092388) (← links)
• On caterpillars of game chromatic number 4 (Q2132381) (← links)
• On indicated coloring of lexicographic product of graphs (Q2161277) (← links)
• A connected version of the graph coloring game (Q2192130) (← links)
• Game chromatic number of generalized Petersen graphs and Jahangir graphs (Q2218005) (← links)
• The difference between game chromatic number and chromatic number of graphs (Q2274521) (← links)
• On the game chromatic number of splitting graphs of path and cycle (Q2330094) (← links)
• The orthogonal colouring game (Q2330119) (← links)
• Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs (Q2427530) (← links)
• The game chromatic index of some trees of maximum degree 4 (Q2449078) (← links)
• Refined activation strategy for the marking game (Q2464148) (← links)
• Very asymmetric marking games (Q2490427) (← links)
• The complexity of two colouring games (Q2696280) (← links)
• The connected greedy coloring game (Q2699943) (← links)