Efficient Graph Packing via Game Colouring
From MaRDI portal
Publication:3552503
DOI10.1017/S0963548309009973zbMath1197.05118MaRDI QIDQ3552503
Henry A. Kierstead, Alexandr V. Kostochka
Publication date: 22 April 2010
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548309009973
91A43: Games involving graphs
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C15: Coloring of graphs and hypergraphs
05C57: Games on graphs (graph-theoretic aspects)
Related Items
The independence coloring game on graphs, Uniquely colorable graphs with equal chromatic and game chromatic numbers, Bounds on the game transversal number in hypergraphs, Adapted game colouring of graphs, Circular game chromatic number of graphs, Chromatic numbers of exact distance graphs, Domination game on uniform hypergraphs, Indicated coloring of graphs, On game chromatic vertex-critical graphs, On caterpillars of game chromatic number 4, Maximum 0-1 timed matching on temporal graphs, Indicated coloring game on Cartesian products of graphs, Game chromatic number of generalized Petersen graphs and Jahangir graphs, Uniform orderings for generalized coloring numbers, 2-coloring number revisited, Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two
Cites Work
- Edge disjoint placement of graphs
- The Ramsey number of a graph with bounded maximum degree
- Packings of graphs and applications to computational complexity
- A bound for the game chromatic number of graphs
- Marking games and the oriented game chromatic number of partial \(k\)-trees
- A simple competitive graph coloring algorithm
- Orderings on graphs and game coloring number
- Subgraphs of graphs. I
- The game coloring number of pseudo partial \(k\)-trees
- Graphs with linearly bounded Ramsey numbers
- An Ore-type analogue of the Sauer-Spencer theorem
- Grad and classes with bounded expansion. I: Decompositions
- Refined activation strategy for the marking game
- ON THE COMPLEXITY OF SOME COLORING GAMES
- On Two Conjectures on Packing of Graphs
