Name
Abstract | ||
|---|---|---|
Let G =( V,E ) be a graph and k ⩾2 be an integer. A set S ⊂ V is k-independent if every component in the subgraph < S ⊂ induced by S has order at most k —1. The general chromatic number χ k ( G ) of G is the minimum order n of a partition P of the set V such that each set V i in P is k -independent. This paper develops properties of χ k ( G ) which are generalizations of well-known properties of chromatic number. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1016/0012-365X(93)90493-D | Discrete Mathematics |
Keywords | Field | DocType |
chromatic number,mathematics | Integer,Discrete mathematics,Graph,Combinatorics,Chromatic scale,Generalization,Bipartite graph,Connectivity,Partition (number theory),Critical graph,Mathematics | Journal |
Volume | Issue | ISSN |
115 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
2 | 0.49 | 2 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| E. Sampathkumar | 1 | 2 | 0.49 |