Cutwidth and degeneracy of graphs

Benoit Kloeckner (1)

1 IF - Institut Fourier

We prove an inequality involving the degeneracy, the cutwidth and the sparsity of graphs. It implies a quadratic lower bound on the cutwidth in terms of the degeneracy for all graphs and an improvement of it for clique-free graphs.

Domaines: Combinatoire [math.CO]; Mathématique discrète [cs.DM]

Benoit Kloeckner. Cutwidth and degeneracy of graphs. 2010. ⟨hal-00408210v2⟩