Game chromatic number of outerplanar graphs

DOI10.1002/(SICI)1097-0118(199901)30:1%3C67::AID-JGT7%3E3.0.CO;2-MMaRDI QIDQ4256107zbMATH OpenOpenAlexFDO

Authors

Publication date 28 June 1999

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199901)30:1%3C67::aid-jgt7%3E3.0.co;2-m

zbMATH Keywords

game chromatic numberouterplanar graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 431513
• Radius two trees specify χ‐bounded classes
• Colouring games on outerplanar graphs and trees

Cites work

• ON THE COMPLEXITY OF SOME COLORING GAMES

Cited in

(68)

• Game-perfect graphs
• Lightness of digraphs in surfaces and directed game chromatic number
• Colouring games on outerplanar graphs and trees
• Circular game chromatic number of graphs
• Game colouring of the square of graphs
• Asymmetric directed graph coloring games
• A bound for the game chromatic number of graphs
• The game coloring number of planar graphs
• A simple competitive graph coloring algorithm. II.
• A simple competitive graph coloring algorithm
• The game coloring number of planar graphs with a specific girth
• Relaxed game chromatic number of trees and outerplanar graphs
• A simple competitive graph coloring algorithm. III
• The game chromatic number and the game colouring number of classes of oriented cactuses
• The strong game colouring number of directed graphs
• The game Grundy number of graphs
• The game coloring number of planar graphs with a given girth
• The incidence game chromatic number of \((a,d)\)-decomposable graphs
• The eternal game chromatic number of random graphs
• Infinite chromatic games
• Game chromatic number of strong product graphs
• On caterpillars of game chromatic number 4
• On indicated coloring of lexicographic product of graphs
• A connected version of the graph coloring game
• Game chromatic number of generalized Petersen graphs and Jahangir graphs
• The difference between game chromatic number and chromatic number of graphs
• On the game chromatic number of splitting graphs of path and cycle
• The orthogonal colouring game
• Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
• The game chromatic index of some trees of maximum degree 4
• Refined activation strategy for the marking game
• Very asymmetric marking games
• The complexity of two colouring games
• The connected greedy coloring game
• Game chromatic index of \(k\)-degenerate graphs
• The graph distance game and some graph operations
• scientific article; zbMATH DE number 431513 (Why is no real title available?)
• Equality perfect graphs and digraphs
• Marking Games
• Game coloring the Cartesian product of graphs
• Game chromatic number of graphs with locally bounded number of cycles
• Adapted game colouring of graphs
• The game \(L(d,1)\)-labeling problem of graphs
• scientific article; zbMATH DE number 6843195 (Why is no real title available?)
• The coloring game on planar graphs with large girth, by a result on sparse cactuses
• scientific article; zbMATH DE number 5194465 (Why is no real title available?)
• The incidence game chromatic number of paths and subgraphs of wheels
• Game chromatic number of toroidal grids
• Game chromatic number of Cartesian product graphs
• Game chromatic number of toroidal grids
• The incidence game chromatic number
• Decomposing planar graphs into graphs with degree restrictions
• Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs
• On the degree of trees with game chromatic number 4
• The game chromatic index of wheels
• Decomposing graphs of nonnegative characteristic into subgraphs with degree restrictions
• Introduction to competitive graph coloring
• State canonization and early pruning in width-based automated theorem proving
• Game chromatic number of honeycomb related networks
• A sufficient condition for nonnegative characteristic graphs to be (2, 1)-decomposable
• On the relaxed colouring game and the unilateral colouring game
• Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers
• The game chromatic number and the game colouring number of cactuses
• Generalised game colouring of graphs
• The relaxed game chromatic index of k-degenerate graphs
• The relaxed edge-coloring game and \(k\)-degenerate graphs
• The relaxed game chromatic number of graphs with cut-vertices
• The 6-relaxed game chromatic number of outerplanar graphs

This page was built for publication: Game chromatic number of outerplanar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4256107)