Abstract
Let $\mad(G)$ denote the maximum average degree (over all subgraphs) of and let denote the injective chromatic number of . We prove that if and $\mad(G)<\frac{14}5$, then . When , we show that $\mad(G)<\frac{36}{13}$ implies . In contrast, we give a graph with , $\mad(G)=\frac{36}{13}$, and .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.