<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.6//EN" "http://www.ncbi.nlm.nih.gov/corehtml/query/static/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>Iranian Mathematical Society (IMS)</PublisherName>
				<JournalTitle>Bulletin of the Iranian Mathematical Society</JournalTitle>
				<Issn>1017-060X</Issn>
				<Volume></Volume>
				<Issue>Articles in Press</Issue>
				<PubDate PubStatus="epublish">
					<Year>2011</Year>
					<Month>05</Month>
					<Day>04</Day>
				</PubDate>
			</Journal>
<ArticleTitle>k-forested choosability of graphs with bounded maximum average degree</ArticleTitle><FirstPage></FirstPage>
			<LastPage></LastPage>
			<Language>en</Language>
<AuthorList>
<Author>
					<FirstName>Xin </FirstName>
					<LastName>Zhang</LastName>
					<Affiliation>School of Mathematics
Shandong University</Affiliation>
				</Author>
<Author>
					<FirstName>Guizhen </FirstName>
					<LastName>Liu</LastName>
					<Affiliation>School of Mathematics
Shandong University</Affiliation>
				</Author>
<Author>
					<FirstName>Jian-Liang </FirstName>
					<LastName>Wu</LastName>
					<Affiliation>School of Mathematics
Shandong University</Affiliation>
				</Author>
</AuthorList>
			<History>
				<PubDate PubStatus="received">
					<Year>2011</Year>
					<Month>05</Month>
					<Day>02</Day>
				</PubDate>
			</History>
		<Abstract><![CDATA[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 $leftlceilfrac{Delta}{k-1}rightrceil+1$, $leftlceilfrac{Delta}{k-1}rightrceil+2$ or $leftlceilfrac{Delta}{k-1}rightrceil+3$ if its maximum average degree is less than $frac{12}{5}$, $frac{8}{3}$ or $3$, respectively.]]></Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">k-forested coloring</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">linear coloring</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">maximum average degree</Param>
			</Object>
		</ObjectList>
</Article>
</ArticleSet>