Cutwidth and degeneracy of graphs
classification
🧮 math.CO
cs.DM
keywords
graphscutwidthdegeneracyboundclique-freeimpliesimprovementinequality
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.