AI Chat AI Image Generator AI Video Text to Speech

2× n Grids have Unbounded Anagram-Free Chromatic Number

05/05/2021

∙

by Saman Bazarghani, et al.

∙

∙

We show that anagram-free vertex colouring a 2× n square grid requires a number of colours that increases with n. This answers an open question in Wilson's thesis and shows that even graphs of pathwidth 2 do not have anagram-free colourings with a bounded number of colours.

Saman Bazarghani
1 publication
Paz Carmi
19 publications
Vida Dujmovic
25 publications
Pat Morin
26 publications

page 6

page 10

research

∙ 01/09/2020

Cops and robbers on 2K_2-free graphs

We prove that the cop number of any 2K_2-free graph is at most 2, which ...

0 Jérémie Turcotte, et al. ∙

research

∙ 06/07/2022

Vertex-critical (P_3+ℓ P_1)-free and vertex-critical (gem, co-gem)-free graphs

A graph G is k-vertex-critical if χ(G)=k but χ(G-v)<k for all v∈ V(G) wh...

0 Tala Abuadas, et al. ∙

research

∙ 06/30/2020

Dichotomizing k-vertex-critical H-free graphs for H of order four

For k ≥ 3, we prove (i) there is a finite number of k-vertex-critical (P...

0 Ben Cameron, et al. ∙

research

∙ 05/25/2021

On the Erdős-Pósa property for long holes in C_4-free graphs

We prove that there exists a function f(k)=𝒪(k^2 log k) such that for ev...

0 Tony Huynh, et al. ∙

research

∙ 04/23/2019

Cops and robbers on oriented toroidal grids

The game of cops and robbers is a well-known game played on graphs. In t...

0 Sebastián González Hermosillo de la Maza, et al. ∙

research

∙ 07/29/2023

Locked Polyomino Tilings

A locked t-omino tiling is a tiling of a finite grid or torus by t-omino...

0 Jamie Tucker-Foltz, et al. ∙

research

∙ 07/17/2019

Online Firefighting on Grids

The Firefighter Problem (FP) is a graph problem originally introduced in...

0 Marc Demange, et al. ∙