Name
Abstract | ||
|---|---|---|
.Every graph of chromatic number k with more than k(r-1)(b-1) vertices hasa b-element independent set of vertices such that if any two of them are joined byan edge then the chromatic number stays the same or a r-element independent setof vertices such that joining any two of them by an edge increases the chromaticnumber.0. Introduction.Let P be a class of graphs and let x and y be a pair of non-adjacent distinctvertices of G#P. For every graph consider a fixed coloring of all ... |
Year | DOI | Venue |
|---|---|---|
1996 | 10.37236/1250 | Electr. J. Comb. |
Keywords | Field | DocType |
independent set | Discrete mathematics,Combinatorics,Markov chain mixing time,Additive Markov chain,Stochastic matrix,Continuous-time Markov chain,Random walk,Markov chain,Independent set,Partition (number theory),Mathematics | Journal |
Volume | Issue | Citations |
3 | 1 | 3 |
PageRank | References | Authors |
1.36 | 3 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ermelinda Delavina | 1 | 23 | 4.51 |
| Siemion Fajtlowicz | 2 | 93 | 26.12 |