A bound for the game chromatic number of graphs

DOI10.1016/S0012-365X(98)00197-6zbMATH Open0928.05022WikidataQ126550987 ScholiaQ126550987MaRDI QIDQ1297403FDOQ1297403

Authors: Thomas Dinski, Xuding Zhu 

Publication date: 19 January 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• The game coloring number of planar graphs
• Radius two trees specify χ‐bounded classes
• scientific article

zbMATH Keywords

treewidthplanar graphacyclic chromatic numbergame chromatic numberorientable genusseries parallel graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Games involving graphs (91A43)

Cites Work

• On acyclic colorings of planar graphs
• Acyclic colorings of planar graphs
• Acyclic and oriented chromatic numbers of graphs
• Title not available (Why is that?)
• Game chromatic number of outerplanar graphs
• The chromatic number of oriented graphs
• The game coloring number of planar graphs
• Radius two trees specify χ‐bounded classes
• Title not available (Why is that?)
• An acyclic analogue to Heawood's theorem

Cited In (66)

• Indicated coloring game on Cartesian products of graphs
• Introduction to competitive graph coloring
• Graph colorings with restricted bicolored subgraphs: II. The graph coloring game
• The difference between game chromatic number and chromatic number of graphs
• On graphs with maximum difference between game chromatic number and chromatic number
• A note on the connected game coloring number
• Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers
• On game chromatic vertex-critical graphs
• The game of arboricity
• Game chromatic number of graphs with locally bounded number of cycles
• The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\)
• Title not available (Why is that?)
• Indicated coloring of matroids
• The graph distance game and some graph operations
• The strong game colouring number of directed graphs
• Generalised game colouring of graphs
• The game coloring number of planar graphs with a specific girth
• Game chromatic index of graphs with given restrictions on degrees
• Colouring games on outerplanar graphs and trees
• Circular game chromatic number of graphs
• The incidence game chromatic number of paths and subgraphs of wheels
• Game brush number
• Radius two trees specify χ‐bounded classes
• Competitive colorings of oriented graphs
• Title not available (Why is that?)
• The incidence game chromatic number of \((a,d)\)-decomposable graphs
• The relaxed edge-coloring game and \(k\)-degenerate graphs
• The eternal game chromatic number of random graphs
• On the game chromatic number of splitting graphs of path and cycle
• Title not available (Why is that?)
• The game \(L(d,1)\)-labeling problem of graphs
• A connected version of the graph coloring game
• Asymmetric coloring games on incomparability graphs
• Bounds on the game transversal number in hypergraphs
• The relaxed game chromatic index of \(k\)-degenerate graphs
• Domination game: a proof of the 3/5-conjecture for graphs with minimum degree at least two
• Game chromatic index of \(k\)-degenerate graphs
• The 6-relaxed game chromatic number of outerplanar graphs
• Weak acyclic coloring and asymmetric coloring games
• Indicated coloring of the Mycielskian of some families of graphs
• Game chromatic number of Cartesian product graphs
• A simple competitive graph coloring algorithm. II.
• Note on the game colouring number of powers of graphs
• The game chromatic index of some trees of maximum degree 4
• The game coloring number of planar graphs
• The game chromatic number of random graphs
• A simple competitive graph coloring algorithm. III
• The game chromatic index of wheels
• The Game Saturation Number of a Graph
• A simple competitive graph coloring algorithm
• On forbidden subdivision characterizations of graph classes
• The game Grundy indices of graphs
• Complete multipartite graphs and the relaxed coloring game
• Efficient graph packing via game colouring
• Lightness of digraphs in surfaces and directed game chromatic number
• Title not available (Why is that?)
• \textsf{PSPACE}-hardness of variants of the graph coloring game
• PSPACE-hardness of two graph coloring games
• PSPACE-completeness of two graph coloring games
• Title not available (Why is that?)
• An upper bound on the extremal version of Hajnal's triangle-free game
• Game coloring the Cartesian product of graphs
• Game chromatic number of some network graphs
• Impartial coloring games
• Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
• Refined activation strategy for the marking game

This page was built for publication: A bound for the game chromatic number of graphs

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