| | |
| | |
Stat |
Members: 3643 Articles: 2'487'895 Articles rated: 2609
28 March 2024 |
|
| | | |
|
Article overview
| |
|
k-forested choosability of graphs with bounded maximum average degree | Xin Zhang
; Guizhen Liu
; Jian-Liang Wu
; | Date: |
19 Feb 2011 | Abstract: | A proper vertex coloring of a simple graph is $k$-forested if the graph
induced by the vertices of any two color classes is a forest with maximum
degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list
of $q$ colors associated with each vertex $v$, there exists a $k$-forested
coloring of $G$ such that each vertex receives a color from its own list. In
this paper, we prove that the $k$-forested choosability of a graph with maximum
degree $Deltageq kgeq 4$ is at most $lceilfrac{Delta}{k-1}
ceil+1$,
$lceilfrac{Delta}{k-1}
ceil+2$ or $lceilfrac{Delta}{k-1}
ceil+3$ if its
maximum average degree is less than 12/5, $8/3 or 3, respectively. | Source: | arXiv, 1102.3987 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |