Pages that link to "Item:Q4309985"
From MaRDI portal
The following pages link to Radius two trees specify χ‐bounded classes (Q4309985):
Displayed 18 items.
- Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers (Q819816) (← links)
- Generalised game colouring of graphs (Q878606) (← links)
- The relaxed game chromatic index of \(k\)-degenerate graphs (Q879391) (← links)
- On forbidden subdivision characterizations of graph classes (Q925035) (← links)
- The 6-relaxed game chromatic number of outerplanar graphs (Q998330) (← links)
- A bound for the game chromatic number of graphs (Q1297403) (← links)
- The game coloring number of planar graphs (Q1305532) (← links)
- A simple competitive graph coloring algorithm. II. (Q1425110) (← links)
- A simple competitive graph coloring algorithm (Q1569067) (← links)
- Relaxed game chromatic number of trees and outerplanar graphs (Q1827712) (← links)
- Approximation algorithms for routing and call scheduling in all-optical chains and rings. (Q1853488) (← links)
- A simple competitive graph coloring algorithm. III (Q1880795) (← links)
- Note on the game chromatic index of trees (Q1884997) (← 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)
- Game coloring the Cartesian product of graphs (Q3605153) (← links)
- Game chromatic number of Cartesian product graphs (Q5900078) (← links)