Choice Numbers of Multi-Bridge Graphs
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-choosa...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2017-12-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | http://www.math.md/files/csjm/v25-n3/v25-n2-(pp247-255).pdf |
| _version_ | 1798025760412270592 |
|---|---|
| author | Julian Allagan Benkam Bobga |
| author_facet | Julian Allagan Benkam Bobga |
| author_sort | Julian Allagan |
| collection | DOAJ |
| description | 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$. |
| first_indexed | 2024-04-11T18:24:08Z |
| format | Article |
| id | doaj.art-5076d4406f6a49a8aae647c04259550d |
| institution | Directory Open Access Journal |
| issn | 1561-4042 |
| language | English |
| last_indexed | 2024-04-11T18:24:08Z |
| publishDate | 2017-12-01 |
| publisher | Vladimir Andrunachievici Institute of Mathematics and Computer Science |
| record_format | Article |
| series | Computer Science Journal of Moldova |
| spelling | doaj.art-5076d4406f6a49a8aae647c04259550d2022-12-22T04:09:41ZengVladimir Andrunachievici Institute of Mathematics and Computer ScienceComputer Science Journal of Moldova1561-40422017-12-01253(75)247255Choice Numbers of Multi-Bridge GraphsJulian Allagan0Benkam Bobga1Elizabeth City State University, Elizabeth City, North Carolina, U.S.AUniversity of North Georgia, Gainesville, Georgia, U.S.ASuppose $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$.http://www.math.md/files/csjm/v25-n3/v25-n2-(pp247-255).pdfList coloringchromatic-choosable$l$-bridge |
| spellingShingle | Julian Allagan Benkam Bobga Choice Numbers of Multi-Bridge Graphs Computer Science Journal of Moldova List coloring chromatic-choosable $l$-bridge |
| title | Choice Numbers of Multi-Bridge Graphs |
| title_full | Choice Numbers of Multi-Bridge Graphs |
| title_fullStr | Choice Numbers of Multi-Bridge Graphs |
| title_full_unstemmed | Choice Numbers of Multi-Bridge Graphs |
| title_short | Choice Numbers of Multi-Bridge Graphs |
| title_sort | choice numbers of multi bridge graphs |
| topic | List coloring chromatic-choosable $l$-bridge |
| url | http://www.math.md/files/csjm/v25-n3/v25-n2-(pp247-255).pdf |
| work_keys_str_mv | AT julianallagan choicenumbersofmultibridgegraphs AT benkambobga choicenumbersofmultibridgegraphs |