The 6-relaxed game chromatic number of outerplanar graphs
From MaRDI portal
(Redirected from Publication:998330)
Recommendations
Cites work
- scientific article; zbMATH DE number 398953 (Why is no real title available?)
- scientific article; zbMATH DE number 5194465 (Why is no real title available?)
- A bound for the game chromatic number of graphs
- A simple competitive graph coloring algorithm
- A simple competitive graph coloring algorithm. II.
- A simple competitive graph coloring algorithm. III
- Competitive colorings of oriented graphs
- Edge-partitions of planar graphs and their game coloring numbers
- Game chromatic index of \(k\)-degenerate graphs
- Game chromatic number of outerplanar graphs
- ON THE COMPLEXITY OF SOME COLORING GAMES
- On the oriented game chromatic number
- Radius two trees specify χ‐bounded classes
- Refined activation strategy for the marking game
- Relaxed game chromatic number of graphs
- Relaxed game chromatic number of trees and outerplanar graphs
- The game coloring number of planar graphs
- The game coloring number of pseudo partial \(k\)-trees
- The relaxed game chromatic number of outerplanar graphs
Cited in
(8)- The relaxed game chromatic number of outerplanar graphs
- Colouring games on outerplanar graphs and trees
- scientific article; zbMATH DE number 5194465 (Why is no real title available?)
- Relaxed game chromatic number of graphs
- On the relaxed colouring game and the unilateral colouring game
- Parallel machine scheduling with general sum of processing time based models
- Relaxed game chromatic number of trees and outerplanar graphs
- Complete multipartite graphs and the relaxed coloring game
This page was built for publication: The 6-relaxed 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 Q998330)