On Hadwiger's Number of a graph with partial information

Simple item page
dc.creatorIstrate, Gabriel
dc.date2009-03-16
dc.date.accessioned2026-07-07T12:52:52Z
dc.date.available2026-07-07T12:52:52Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/0903.2742
dc.identifierhttp://arxiv.org/abs/0903.2742
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/223437
dc.subjectDiscrete Mathematics
dc.titleOn Hadwiger's Number of a graph with partial information
dc.typetext

Files

Collections

arXiv