The relaxed game chromatic number of graphs with cut-vertices
From MaRDI portal
(Redirected from Publication:897291)
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 simple competitive graph coloring algorithm. II.
- A simple competitive graph coloring algorithm. III
- Colouring game and generalized colouring game on graphs with cut-vertices
- Game chromatic number of outerplanar graphs
- On the relaxed colouring game and the unilateral colouring game
- Relaxed game chromatic number of graphs
- Relaxed game chromatic number of trees and outerplanar graphs
- The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\)
- The relaxed game chromatic index of \(k\)-degenerate graphs
Cited in
(9)- scientific article; zbMATH DE number 5194465 (Why is no real title available?)
- Relaxed game chromatic number of graphs
- The relaxed edge-coloring game and \(k\)-degenerate graphs
- On the relaxed colouring game and the unilateral colouring game
- The relaxed game chromatic index of \(k\)-degenerate graphs
- The 6-relaxed game chromatic number of outerplanar graphs
- Colouring game and generalized colouring game on graphs with cut-vertices
- Relaxed game chromatic number of trees and outerplanar graphs
- Relaxed chromatic numbers of graphs
This page was built for publication: The relaxed game chromatic number of graphs with cut-vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897291)