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