Game chromatic number of outerplanar graphs

From MaRDI portal
Publication:4256107

DOI<67::AID-JGT7>3.0.CO;2-M 10.1002/(SICI)1097-0118(199901)30:1<67::AID-JGT7>3.0.CO;2-MzbMath0929.05032OpenAlexW4230270369MaRDI QIDQ4256107

No author found.

Publication date: 28 June 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199901)30:1<67::aid-jgt7>3.0.co;2-m




Related Items

Edge-partitions of graphs of nonnegative characteristic and their game coloring numbersA simple competitive graph coloring algorithm. IIIThe graph distance game and some graph operationsOn caterpillars of game chromatic number 4Unnamed ItemThe game chromatic number and the game colouring number of cactusesAsymmetric coloring games on incomparability graphsOn indicated coloring of lexicographic product of graphsGeneralised game colouring of graphsThe relaxed game chromatic index of \(k\)-degenerate graphsGame chromatic index ofk-degenerate graphsThe relaxed edge-coloring game and \(k\)-degenerate graphsDecomposing planar graphs into graphs with degree restrictionsA connected version of the graph coloring gameDecompositions of graphs of nonnegative characteristic with some forbidden subgraphsAdapted game colouring of graphsThe relaxed game chromatic number of graphs with cut-verticesOn the degree of trees with game chromatic number 4Lower bounds for the game colouring number of partial \(k\)-trees and planar graphsThe game chromatic number and the game colouring number of classes of oriented cactusesThe strong game colouring number of directed graphsThe complexity of two colouring gamesThe connected greedy coloring gameThe game chromatic index of wheelsThe game Grundy number of graphsThe game \(L(d,1)\)-labeling problem of graphsA simple competitive graph coloring algorithm. II.Game chromatic number of generalized Petersen graphs and Jahangir graphsThe game chromatic index of some trees of maximum degree 4Game chromatic number of toroidal gridsRefined activation strategy for the marking gameThe game coloring number of planar graphs with a specific girthThe coloring game on planar graphs with large girth, by a result on sparse cactusesGame chromatic number of Cartesian product graphsGame chromatic number of toroidal gridsThe incidence game chromatic numberThe incidence game chromatic number of paths and subgraphs of wheelsVery asymmetric marking gamesThe game coloring number of planar graphs with a given girthThe incidence game chromatic number of \((a,d)\)-decomposable graphsThe difference between game chromatic number and chromatic number of graphsGame coloring the Cartesian product of graphsThe eternal game chromatic number of random graphsThe 6-relaxed game chromatic number of outerplanar graphsOn the relaxed colouring game and the unilateral colouring gameGame-perfect graphsOn indicated coloring of some classes of graphsLightness of digraphs in surfaces and directed game chromatic numberColouring games on outerplanar graphs and treesInfinite chromatic gamesA simple competitive graph coloring algorithmRelaxed game chromatic number of trees and outerplanar graphsCircular game chromatic number of graphsGame colouring of the square of graphsAsymmetric directed graph coloring gamesOn the game chromatic number of splitting graphs of path and cycleThe orthogonal colouring gameA bound for the game chromatic number of graphsGame chromatic number of strong product graphsThe game coloring number of planar graphsMarking Games



Cites Work