RO  EN
IMI/Publicaţii/CSJM/Ediţii/CSJM v.25, n.3 (75), 2017/

Choice Numbers of Multi-Bridge Graphs

Authors: Julian Allagan, Benkam Bobga
Keywords: List coloring, chromatic-choosable, l-bridge

Abstract

Suppose $ch(G)$ and $\chi(G)$ denote, respectively, the choice number and the chromatic number of a graph $G=(V,E)$. If $ch(G)=\chi(G)$, then $G$ is said to be chromatic-choosable. Here, we find the choice numbers of all multi-bridge or $l$-bridge graphs and classify those that are chromatic-choosable for all $l\ge 2$.

Julian Allagan
Elizabeth City State University
Elizabeth City, North Carolina, U.S.A
E-mail:

Benkam Bobga
University of North Georgia
Gainesville, Georgia, U.S.A
E-mail:

Fulltext

Adobe PDF document0.10 Mb