On b-perfect chordal graphs

Simple item page
dc.creatorMaffray, Frédéric
dc.creatorMechebbek, Meriem
dc.date2007-11-26
dc.date.accessioned2026-07-07T08:44:55Z
dc.date.available2026-07-07T08:44:55Z
dc.descriptionThe b-chromatic number of a graph G is the largest integer k such that G has a coloring of the vertices in k color classes such that every color class contains a vertex that has a neighbour in all other color classes. We characterize the class of chordal graphs for which the b-chromatic number is equal to the chromatic number for every induced subgraph.
dc.identifierhttps://arxiv.org/abs/0711.3959
dc.identifierhttp://arxiv.org/abs/0711.3959
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/142826
dc.subjectDiscrete Mathematics
dc.titleOn b-perfect chordal graphs
dc.typetext

Files

Collections

arXiv