### Abstract

A 3-consecutive C-coloring of a graph G = (V,E) is a mapping ρ : V → ℕ such that every path on three vertices has at most two colors. We prove general estimates on the maximum number X3CC(G) of colors in a 3-consecutive C-coloring of G, and characterize the structure of connected graphs with X3CC(G) ≥ k for k = 3 and k = 4.

Original language | English |
---|---|

Pages (from-to) | 393-405 |

Number of pages | 13 |

Journal | Discussiones Mathematicae - Graph Theory |

Volume | 30 |

Issue number | 3 |

Publication status | Published - 2010 |

### Fingerprint

### Keywords

- Consecutive coloring
- Graph coloring
- Upper chromatic number
- Vertex coloring

### ASJC Scopus subject areas

- Applied Mathematics
- Discrete Mathematics and Combinatorics

### Cite this

*Discussiones Mathematicae - Graph Theory*,

*30*(3), 393-405.

**3-Consecutive c-colorings of graphs.** / Bujtás, Csilla; Sampathkumar, E.; Tuza, Z.; Subramanya, M. S.; Dominic, Charles.

Research output: Contribution to journal › Article

*Discussiones Mathematicae - Graph Theory*, vol. 30, no. 3, pp. 393-405.

}

TY - JOUR

T1 - 3-Consecutive c-colorings of graphs

AU - Bujtás, Csilla

AU - Sampathkumar, E.

AU - Tuza, Z.

AU - Subramanya, M. S.

AU - Dominic, Charles

PY - 2010

Y1 - 2010

N2 - A 3-consecutive C-coloring of a graph G = (V,E) is a mapping ρ : V → ℕ such that every path on three vertices has at most two colors. We prove general estimates on the maximum number X3CC(G) of colors in a 3-consecutive C-coloring of G, and characterize the structure of connected graphs with X3CC(G) ≥ k for k = 3 and k = 4.

AB - A 3-consecutive C-coloring of a graph G = (V,E) is a mapping ρ : V → ℕ such that every path on three vertices has at most two colors. We prove general estimates on the maximum number X3CC(G) of colors in a 3-consecutive C-coloring of G, and characterize the structure of connected graphs with X3CC(G) ≥ k for k = 3 and k = 4.

KW - Consecutive coloring

KW - Graph coloring

KW - Upper chromatic number

KW - Vertex coloring

UR - http://www.scopus.com/inward/record.url?scp=77956556296&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77956556296&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:77956556296

VL - 30

SP - 393

EP - 405

JO - Discussiones Mathematicae - Graph Theory

JF - Discussiones Mathematicae - Graph Theory

SN - 1234-3099

IS - 3

ER -