2000 character limit reached
Cutwidth and degeneracy of graphs
Published 29 Jul 2009 in math.CO and cs.DM | (0907.5138v2)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.