On Hadwiger's Number of a graph with partial information

Details On Hadwiger's Number of a graph with partial information On Hadwiger's Number of a graph with partial information

2009-03-16

arxiv.org/abs/0903.2742v1

Computer Science

Discrete Mathematics

Scientific paper

We investigate the possibility of proving upper bounds on Hadwiger's number
of a graph with partial information, mirroring several known upper bounds for
the chromatic number. For each such bound we determine whether the
corresponding bound for Hadwiger's number holds. Our results suggest that the
``locality'' of an inequality accounts for the existence of such an extension.

Affiliated with

Also associated with

No associations

Rating

On Hadwiger's Number of a graph with partial information 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 On Hadwiger's Number of a graph with partial information, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Hadwiger's Number of a graph with partial information will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-223919