Pages that link to "Item:Q1396657"
From MaRDI portal
The following pages link to Marking games and the oriented game chromatic number of partial \(k\)-trees (Q1396657):
Displaying 13 items.
- Homomorphisms and colourings of oriented graphs: an updated survey (Q279228) (← links)
- The game chromatic number and the game colouring number of cactuses (Q845991) (← links)
- The relaxed game chromatic index of \(k\)-degenerate graphs (Q879391) (← links)
- The relaxed edge-coloring game and \(k\)-degenerate graphs (Q890010) (← links)
- Colouring games on outerplanar graphs and trees (Q1025941) (← links)
- A simple competitive graph coloring algorithm. II. (Q1425110) (← links)
- The game Grundy number of graphs (Q1956234) (← links)
- Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs (Q2427530) (← links)
- Refined activation strategy for the marking game (Q2464148) (← links)
- Weak acyclic coloring and asymmetric coloring games (Q2488942) (← links)
- Marking Games (Q3439438) (← links)
- Efficient Graph Packing via Game Colouring (Q3552503) (← links)
- Game coloring the Cartesian product of graphs (Q3605153) (← links)