Pages that link to "Item:Q4309985"
From MaRDI portal
The following pages link to Radius two trees specify χ‐bounded classes (Q4309985):
Displayed 20 items.
- 2-coloring number revisited (Q2333797) (← 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)
- The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices (Q2662887) (← links)
- The connected greedy coloring game (Q2699943) (← links)
- Computer Science Unplugged and Related Projects in Math and Computer Science Popularization (Q2908546) (← links)
- Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two (Q3462542) (← links)
- Game coloring the Cartesian product of graphs (Q3605153) (← links)
- Coloring and Covering Nowhere Dense Graphs (Q4553722) (← links)
- (Q5241174) (← links)
- Uniquely colorable graphs with equal chromatic and game chromatic numbers (Q5866017) (← links)
- Game chromatic number of toroidal grids (Q5891223) (← links)
- Game chromatic number of Cartesian product graphs (Q5900078) (← links)
- Game chromatic number of toroidal grids (Q5901168) (← links)
- On the generalised colouring numbers of graphs that exclude a fixed minor (Q5920084) (← links)
- (Q6072045) (← links)
- A note on the Gyárfás-Sumner conjecture (Q6121918) (← links)
- Shallow Minors, Graph Products, and Beyond-Planar Graphs (Q6130539) (← links)
- On monotonicity in maker-breaker graph colouring games (Q6202940) (← links)