Open Access3-consecutive C-colorings of graphs
Author(s) -
Csilla Bujtás,
Charles Dominic,
E. Sampathkumar,
Manjunath SiddaiahSubramanya,
Źsolt Tuza
Publication year - 2010
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.1502
Subject(s) - combinatorics , mathematics , graph , complete coloring , discrete mathematics , graph power , line graph
A 3-consecutive C-coloring of a graph G = (V;E) is a mapping ' :V ! N such that every path on three vertices has at most two colors. We prove general estimates on the maximum number 3CC(G) of colors in a 3-consecutive C-coloring of G, and characterize the structure of connected graphs with 3CC(G) k for k = 3 and k = 4
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom