| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 599 15 |
| Ultima descărcare din IBN: 2023-10-07 04:55 |
| Căutarea după subiecte similare conform CZU |
| 004.42:519.1 (1) |
| Программные средства (296) |
| Комбинаторный анализ. Теория графов (115) |
 SM ISO690:2012ALLAGAN, Julian-A., BOBGA, Benkam. Choice Numbers of Multi-Bridge Graphs. In: Computer Science Journal of Moldova, 2017, nr. 3(75), pp. 247-255. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Computer Science Journal of Moldova |
||||||
| Numărul 3(75) / 2017 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 004.42:519.1 | ||||||
| Pag. 247-255 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
Suppose ch(G) and _(G) denote, respectively, the choice number and the chromatic number of a graph G = (V,E). If ch(G) = _(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 ≥ 2. |
||||||
| Cuvinte-cheie List coloring, chromatic-choosable, l-bridge |
||||||
|
|
|
|
