### Abstract

The game colouring number gcol(G) of a graph G is the least k such that, if two players take turns choosing the vertices of a graph, then either of them can ensure that every vertex has fewer than k neighbours chosen before it, regardless of what choices the other player makes. Clearly gcol(G) (G)+1. Sauer and Spencer [20] proved that if two graphs G1 and G2 on n vertices satisfy 2Δ (G1)≤ Δ(G2) < n then they pack, i.e., there is an embedding of G_{1} into the complement of G_{2}. We improve this by showing that if (gcol(G_{1})1) Δ (G_{2})+(gcol(G _{2})1)(G_{1}) < n then G_{1} and G_{2} pack. To our knowledge this is the first application of colouring games to a non-game problem.

Original language | English (US) |
---|---|

Pages (from-to) | 765-774 |

Number of pages | 10 |

Journal | Combinatorics Probability and Computing |

Volume | 18 |

Issue number | 5 |

DOIs | |

State | Published - Sep 2009 |

### Fingerprint

### ASJC Scopus subject areas

- Applied Mathematics
- Theoretical Computer Science
- Computational Theory and Mathematics
- Statistics and Probability

### Cite this

*Combinatorics Probability and Computing*,

*18*(5), 765-774. https://doi.org/10.1017/S0963548309009973

**Efficient graph packing via game Colouring.** / Kierstead, Henry; Kostochka, A. V.

Research output: Contribution to journal › Article

*Combinatorics Probability and Computing*, vol. 18, no. 5, pp. 765-774. https://doi.org/10.1017/S0963548309009973

}

TY - JOUR

T1 - Efficient graph packing via game Colouring

AU - Kierstead, Henry

AU - Kostochka, A. V.

PY - 2009/9

Y1 - 2009/9

N2 - The game colouring number gcol(G) of a graph G is the least k such that, if two players take turns choosing the vertices of a graph, then either of them can ensure that every vertex has fewer than k neighbours chosen before it, regardless of what choices the other player makes. Clearly gcol(G) (G)+1. Sauer and Spencer [20] proved that if two graphs G1 and G2 on n vertices satisfy 2Δ (G1)≤ Δ(G2) < n then they pack, i.e., there is an embedding of G1 into the complement of G2. We improve this by showing that if (gcol(G1)1) Δ (G2)+(gcol(G 2)1)(G1) < n then G1 and G2 pack. To our knowledge this is the first application of colouring games to a non-game problem.

AB - The game colouring number gcol(G) of a graph G is the least k such that, if two players take turns choosing the vertices of a graph, then either of them can ensure that every vertex has fewer than k neighbours chosen before it, regardless of what choices the other player makes. Clearly gcol(G) (G)+1. Sauer and Spencer [20] proved that if two graphs G1 and G2 on n vertices satisfy 2Δ (G1)≤ Δ(G2) < n then they pack, i.e., there is an embedding of G1 into the complement of G2. We improve this by showing that if (gcol(G1)1) Δ (G2)+(gcol(G 2)1)(G1) < n then G1 and G2 pack. To our knowledge this is the first application of colouring games to a non-game problem.

UR - http://www.scopus.com/inward/record.url?scp=74049137505&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=74049137505&partnerID=8YFLogxK

U2 - 10.1017/S0963548309009973

DO - 10.1017/S0963548309009973

M3 - Article

VL - 18

SP - 765

EP - 774

JO - Combinatorics Probability and Computing

JF - Combinatorics Probability and Computing

SN - 0963-5483

IS - 5

ER -