Pages that link to "Item:Q3552503"
From MaRDI portal
The following pages link to Efficient Graph Packing via Game Colouring (Q3552503):
Displaying 17 items.
- Bounds on the game transversal number in hypergraphs (Q326647) (← links)
- Adapted game colouring of graphs (Q412230) (← links)
- Circular game chromatic number of graphs (Q1043981) (← links)
- Chromatic numbers of exact distance graphs (Q1633747) (← links)
- Domination game on uniform hypergraphs (Q1732097) (← links)
- Indicated coloring of graphs (Q1761467) (← links)
- On game chromatic vertex-critical graphs (Q2107136) (← links)
- On caterpillars of game chromatic number 4 (Q2132381) (← links)
- Maximum 0-1 timed matching on temporal graphs (Q2161255) (← links)
- Indicated coloring game on Cartesian products of graphs (Q2217485) (← links)
- Game chromatic number of generalized Petersen graphs and Jahangir graphs (Q2218005) (← links)
- Uniform orderings for generalized coloring numbers (Q2225419) (← links)
- 2-coloring number revisited (Q2333797) (← links)
- Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two (Q3462542) (← links)
- The independence coloring game on graphs (Q5048907) (← links)
- Uniquely colorable graphs with equal chromatic and game chromatic numbers (Q5866017) (← links)
- On the degree of trees with game chromatic number 4 (Q6140979) (← links)