3-Consecutive c-colorings of graphs

Csilla Bujtás, E. Sampathkumar, Z. Tuza, M. S. Subramanya, Charles Dominic

Research output: Contribution to journalArticle

12 Citations (Scopus)

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 languageEnglish
Pages (from-to)393-405
Number of pages13
JournalDiscussiones Mathematicae - Graph Theory
Volume30
Issue number3
Publication statusPublished - 2010

Fingerprint

Coloring
Colouring
Consecutive
Color
Graph in graph theory
Connected graph
Path
Estimate

Keywords

  • Consecutive coloring
  • Graph coloring
  • Upper chromatic number
  • Vertex coloring

ASJC Scopus subject areas

  • Applied Mathematics
  • Discrete Mathematics and Combinatorics

Cite this

Bujtás, C., Sampathkumar, E., Tuza, Z., Subramanya, M. S., & Dominic, C. (2010). 3-Consecutive c-colorings of graphs. 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.

In: Discussiones Mathematicae - Graph Theory, Vol. 30, No. 3, 2010, p. 393-405.

Research output: Contribution to journalArticle

Bujtás, C, Sampathkumar, E, Tuza, Z, Subramanya, MS & Dominic, C 2010, '3-Consecutive c-colorings of graphs', Discussiones Mathematicae - Graph Theory, vol. 30, no. 3, pp. 393-405.
Bujtás C, Sampathkumar E, Tuza Z, Subramanya MS, Dominic C. 3-Consecutive c-colorings of graphs. Discussiones Mathematicae - Graph Theory. 2010;30(3):393-405.
Bujtás, Csilla ; Sampathkumar, E. ; Tuza, Z. ; Subramanya, M. S. ; Dominic, Charles. / 3-Consecutive c-colorings of graphs. In: Discussiones Mathematicae - Graph Theory. 2010 ; Vol. 30, No. 3. pp. 393-405.
@article{61208d68eb1344368b89c60d58fda92f,
title = "3-Consecutive c-colorings of graphs",
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.",
keywords = "Consecutive coloring, Graph coloring, Upper chromatic number, Vertex coloring",
author = "Csilla Bujt{\'a}s and E. Sampathkumar and Z. Tuza and Subramanya, {M. S.} and Charles Dominic",
year = "2010",
language = "English",
volume = "30",
pages = "393--405",
journal = "Discussiones Mathematicae - Graph Theory",
issn = "1234-3099",
publisher = "University of Zielona Gora",
number = "3",

}

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 -