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 |