E-resources
Peer reviewed
Open access
-
Aliaj, Jurgen; Molloy, Michael
Journal of graph theory, September 2023, Volume: 104, Issue: 1Journal Article
The adaptable choosability of a multigraph G $G$, denoted cha(G) ${\text{ch}}_{a}(G)$, is the smallest integer k $k$ such that any edge labelling, τ $\tau $, of G $G$ and any assignment of lists of size k $k$ to the vertices of G $G$ permits a list colouring, σ $\sigma $, of G $G$ such that there is no edge e=uv $e=uv$ where τ(e)=σ(u)=σ(v) $\tau (e)=\sigma (u)=\sigma (v)$. Here we show that for a multigraph G $G$ with maximum degree Δ ${\rm{\Delta }}$ and no cycles of length 3 or 4, cha(G)≤(22+o(1))Δ∕ln Δ ${\text{ch}}_{a}(G)\,\le (2\sqrt{2}+o(1))\sqrt{{\rm{\Delta }}\unicode{x02215}\mathrm{ln}\unicode{x0200A}{\rm{\Delta }}}$. Under natural restrictions we can show that the same bound holds for the conflict choosability of G $G$, which is a closely related parameter recently defined by Dvořák, Esperet, Kang and Ozeki.
![loading ... loading ...](themes/default/img/ajax-loading.gif)
Shelf entry
Permalink
- URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year | Impact factor | Edition | Category | Classification | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Select the library membership card:
If the library membership card is not in the list,
add a new one.
DRS, in which the journal is indexed
Database name | Field | Year |
---|
Links to authors' personal bibliographies | Links to information on researchers in the SICRIS system |
---|
Source: Personal bibliographies
and: SICRIS
The material is available in full text. If you wish to order the material anyway, click the Continue button.