A bound for the game chromatic number of graphs

DOI10.1016/S0012-365X(98)00197-6MaRDI QIDQ1297403zbMATH OpenWikidataFDO

Authors Thomas Dinski, Xuding Zhu

Publication date 19 January 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(98)00197-6

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)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 139777 (Why is no real title available?)
• scientific article; zbMATH DE number 398953 (Why is no real title available?)
• Acyclic and oriented chromatic numbers of graphs
• Acyclic colorings of planar graphs
• An acyclic analogue to Heawood's theorem
• Game chromatic number of outerplanar graphs
• On acyclic colorings of planar graphs
• Radius two trees specify χ‐bounded classes
• The chromatic number of oriented graphs
• The game coloring number of planar graphs

Cited in

(68)

• Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
• Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers
• Refined activation strategy for the marking game
• On game chromatic vertex-critical graphs
• The game of arboricity
• Indicated coloring game on Cartesian products of graphs
• Game chromatic number of graphs with locally bounded number of cycles
• Indicated coloring of matroids
• The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\)
• The graph distance game and some graph operations
• scientific article; zbMATH DE number 398953 (Why is no real title available?)
• A biased edge coloring game
• Generalised game colouring of graphs
• The strong game colouring number of directed 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
• Introduction to competitive graph coloring
• Competitive colorings of oriented graphs
• The incidence game chromatic number of \((a,d)\)-decomposable graphs
• scientific article; zbMATH DE number 5194465 (Why is no real title available?)
• 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
• The game \(L(d,1)\)-labeling problem of graphs
• scientific article; zbMATH DE number 6843195 (Why is no real title available?)
• Bounds on the game transversal number in hypergraphs
• Graph colorings with restricted bicolored subgraphs: II. The graph coloring game
• A connected version of the graph coloring game
• 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
• The 6-relaxed game chromatic number of outerplanar graphs
• Game chromatic index of \(k\)-degenerate graphs
• The difference between game chromatic number and chromatic number of 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
• On graphs with maximum difference between game chromatic number and chromatic number
• The harmonious coloring game
• The game chromatic index of some trees of maximum degree 4
• The game coloring number of planar graphs
• The game chromatic index of wheels
• A simple competitive graph coloring algorithm. III
• The game chromatic number of random graphs
• A simple competitive graph coloring algorithm
• The Game Saturation Number of a Graph
• On forbidden subdivision characterizations of graph classes
• The game Grundy indices of graphs
• Complete multipartite graphs and the relaxed coloring game
• Lightness of digraphs in surfaces and directed game chromatic number
• Efficient graph packing via game colouring
• scientific article; zbMATH DE number 431513 (Why is no real title available?)
• \textsf{PSPACE}-hardness of variants of the graph coloring game
• Game chromatic number of honeycomb related networks
• PSPACE-hardness of two graph coloring games
• An upper bound on the extremal version of Hajnal's triangle-free game
• PSPACE-completeness of two graph coloring games
• scientific article; zbMATH DE number 5670857 (Why is no real title available?)
• A note on the connected game coloring number
• Game coloring the Cartesian product of graphs
• Game chromatic number of some network graphs
• Impartial coloring games

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)