Name
Abstract | ||
|---|---|---|
In this paper, we prove that for any graph G and any positive integer in, G is (2m, m)-paintable if and only if G is 2-paintable. It was asked by Zhu in 2009 whether k-paintable graphs are (km,m)-paintable for any positive integer m. Our result answers this question in the affirmative for k = 2. |
Year | Venue | Field |
|---|---|---|
2015 | ELECTRONIC JOURNAL OF COMBINATORICS | Integer,Discrete mathematics,Graph,Combinatorics,Mathematics |
DocType | Volume | Issue |
Journal | 22.0 | 2.0 |
ISSN | Citations | PageRank |
1077-8926 | 0 | 0.34 |
References | Authors | |
4 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Mahoney | 1 | 6 | 2.40 |
| Jixian Meng | 2 | 1 | 1.05 |
| Xuding Zhu | 3 | 1883 | 190.19 |