Tree-width of hypergraphs and surface duality

Details Tree-width of hypergraphs and surface duality Tree-width of hypergraphs and surface duality

2008-12-16

arxiv.org/abs/0812.2990v1

Computer Science

Discrete Mathematics

Scientific paper

In Graph Minor III, Robertson and Seymour conjecture that the tree-width of a
planar graph and that of its dual differ by at most one. We prove that given a
hypergraph H on a surface of Euler genus k, the tree-width of H^* is at most
the maximum of tw(H) + 1 + k and the maximum size of a hyperedge of H^*.

Affiliated with

Also associated with

No associations

Rating

Tree-width of hypergraphs and surface duality 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 Tree-width of hypergraphs and surface duality, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tree-width of hypergraphs and surface duality will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-226799