Pages that link to "Item:Q1305532"
From MaRDI portal
The following pages link to The game coloring number of planar graphs (Q1305532):
Displayed 50 items.
- Asymmetric coloring games on incomparability graphs (Q324375) (← links)
- Game chromatic number of direct product of some families of graphs (Q327677) (← links)
- Decomposition of sparse graphs into two forests, one having bounded maximum degree (Q407602) (← links)
- Coloring games on squares of graphs (Q408174) (← links)
- The game \(L(d,1)\)-labeling problem of graphs (Q456896) (← links)
- Indicated coloring of matroids (Q477356) (← links)
- Decomposing a graph into pseudoforests with one having bounded degree (Q490985) (← links)
- The game Grundy indices of graphs (Q498433) (← links)
- The coloring game on matroids (Q507509) (← links)
- The coloring game on planar graphs with large girth, by a result on sparse cactuses (Q512597) (← links)
- On-line list coloring of matroids (Q516838) (← links)
- The incidence game chromatic number of paths and subgraphs of wheels (Q534326) (← links)
- The game chromatic index of wheels (Q643001) (← links)
- Decomposing a graph into forests: the nine dragon tree conjecture is true (Q722313) (← links)
- On the relaxed colouring game and the unilateral colouring game (Q742610) (← links)
- Decomposing a graph into forests (Q765188) (← 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)
- 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)
- Directed defective asymmetric graph coloring games (Q968138) (← links)
- Decomposition of sparse graphs, with application to game coloring number (Q968426) (← links)
- The 6-relaxed game chromatic number of outerplanar graphs (Q998330) (← links)
- Relaxed very asymmetric coloring games (Q1011775) (← 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)
- Circular game chromatic number of graphs (Q1043981) (← links)
- Game colouring of the square of graphs (Q1043984) (← links)
- Generalization of transitive fraternal augmentations for directed graphs and its applications (Q1043997) (← links)
- Asymmetric directed graph coloring games (Q1045076) (← links)
- A bound for the game chromatic number of graphs (Q1297403) (← links)
- A simple competitive graph coloring algorithm. II. (Q1425110) (← links)
- A simple competitive graph coloring algorithm (Q1569067) (← links)
- On the game coloring index of \(F^+\)-decomposable graphs (Q1693133) (← links)
- Majority coloring game (Q1727720) (← links)
- On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers (Q1732763) (← links)
- The game coloring number of planar graphs with a specific girth (Q1743687) (← links)
- Spanning tree with lower bound on the degrees (Q1744244) (← links)
- The median game (Q1751121) (← links)
- Indicated coloring of graphs (Q1761467) (← 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 coloring number of planar graphs with a given girth (Q2017053) (← links)