3-consecutive c-colorings of graphs

Csilla Bujtás; E. Sampathkumar; Zsolt Tuza; M. Subramanya; Charles Dominic

ArticleOriginal scientific text

Title

3-consecutive c-colorings of graphs

Authors ¹, ², ^1,², ², ²

Affiliations

Department of Computer Science, University of Pannonia, H-8200 Veszprém, Egyetem u. 10, Hungary
Department of Mathematics, University of Mysore, Mysore, India

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

{(χ ̅)}_{3 ℂ} (G)

of colors in a 3-consecutive C-coloring of G, and characterize the structure of connected graphs with

{(χ ̅)}_{3 ℂ} (G) \geq k

for k = 3 and k = 4.

Keywords

ENG

graph coloring, vertex coloring, consecutive coloring, upper chromatic number

C. Berge, Hypergraphs (North-Holland, 1989).
Cs. Bujtás and Zs. Tuza, Color-bounded hypergraphs, I: General results, Discrete Math. 309 (2009) 4890-4902, doi: 10.1016/j.disc.2008.04.019.
Cs. Bujtás and Zs. Tuza, Color-bounded hypergraphs, II: Interval hypergraphs and hypertrees, Discrete Math. in print, doi:10.1016/j.disc.2008.10.023
G.J. Chang, M. Farber and Zs. Tuza, Algorithmic aspects of neighborhood numbers, SIAM J. Discrete Math. 6 (1993) 24-29, doi: 10.1137/0406002.
S. Hedetniemi and R. Laskar, Connected domination in graphs, in: Graph Theory and Combinatorics, B. Bollobás, Ed. (Academic Press, London, 1984) 209-218.
J. Lehel and Zs. Tuza, Neighborhood perfect graphs, Discrete Math. 61 (1986) 93-101, doi: 10.1016/0012-365X(86)90031-2.
E. Sampathkumar, DST Project Report, No.SR/S4/MS.275/05.
E. Sampathkumar, M.S. Subramanya and C. Dominic, 3-Consecutive vertex coloring of a graph, Proc. Int. Conf. ICDM (University of Mysore, India, 2008) 147-151.
E. Sampathkumar and P.S. Neralagi, The neighourhood number of a graph, Indian J. Pure Appl. Math. 16 (1985) 126-132.
E. Sampathkumar and H.B. Walikar, The connected domination number of a graph, J. Math. Phys. Sci. 13 (1979) 607-613.
F. Sterboul, A new combinatorial parameter, in: Infinite and Finite Sets (A. Hajnal et al., Eds.), Colloq. Math. Soc. J. Bolyai, 10, Keszthely 1973 (North-Holland/American Elsevier, 1975) Vol. III pp. 1387-1404.
V. Voloshin, The mixed hypergraphs, Computer Sci. J. Moldova 1 (1993) 45-52.

Title

3-consecutive c-colorings of graphs

Affiliations

Abstract

Keywords

Bibliography