Cutwidth and degeneracy of graphs

Details Cutwidth and degeneracy of graphs Cutwidth and degeneracy of graphs

2009-07-29

arxiv.org/abs/0907.5138v2

Mathematics

Combinatorics

v2: slightly shortened, some typos corrected.

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Cutwidth and degeneracy of graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cutwidth and degeneracy of graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cutwidth and degeneracy of graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-521713