Name
Abstract | ||
|---|---|---|
Let $$G$$ G be a graph of order $$n$$ n and size $$m$$ m . Suppose that $$f:V(G)\rightarrow {\mathbb {N}}$$ f : V ( G ) N is a function such that $$\sum _{v\in V(G)}f(v)=m+n$$ v V ( G ) f ( v ) = m + n . In this paper we provide a criterion for $$f$$ f -choosability of $$G$$ G . Using this criterion, it is shown that the choice number of the complete $$k$$ k -partite graph $$K_{2,2,\ldots ,2}$$ K 2 , 2 , , 2 is $$k$$ k , which is a well-known result due to Erdös, Rubin and Taylor. Among other results we study the $$f$$ f -choosability of the complete $$k$$ k -partite graphs with part sizes at most $$2$$ 2 , when $$f(v)\in \{k-1,k\}$$ f ( v ) ¿ { k - 1 , k } , for every vertex $$v\in V(G)$$ v ¿ V ( G ) . |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/s00373-014-1411-7 | Graphs and Combinatorics |
Keywords | Field | DocType |
Choosability, List coloring, 05C15 | Graph,Combinatorics,Algebraic number,Vertex (geometry),List coloring,Choice number,Mathematics | Journal |
Volume | Issue | ISSN |
31 | 3 | 1435-5914 |
Citations | PageRank | References |
0 | 0.34 | 9 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Saieed Akbari | 1 | 140 | 35.56 |
| Dariush Kiani | 2 | 26 | 5.86 |
| Fatemeh Mohammadi | 3 | 1 | 1.56 |
| Somayeh Moradi | 4 | 0 | 0.68 |
| Farhad Rahmati | 5 | 3 | 2.43 |