Name
Abstract | ||
|---|---|---|
Let αk(G) denote the maximum number of vertices in a k-colorable subgraph of G. Set αk(G)=αk(G)−α(k−1)(G). The sequence a1(G), a2(G),… is called the chromatic difference sequence of the graph G. We present necessary and sufficient conditions for a sequence to be the chromatic difference sequence of some 4-colorable graph. |
Year | DOI | Venue |
|---|---|---|
1980 | 10.1016/0095-8956(80)90040-4 | Journal of Combinatorial Theory, Series B |
Field | DocType | Volume |
Wheel graph,Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Graph power,Chromatic scale,Graph factorization,Friendship graph,Mathematics | Journal | 29 |
Issue | ISSN | Citations |
1 | 0095-8956 | 10 |
PageRank | References | Authors |
2.69 | 2 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael O. Albertson | 1 | 359 | 59.40 |
| David M. Berman | 2 | 42 | 7.00 |