3-consecutive c-colorings of graphs
Csilla Bujtás ; E. Sampathkumar ; Zsolt Tuza ; M.S. Subramanya ; Charles Dominic
Discussiones Mathematicae Graph Theory, Tome 30 (2010), p. 393-405 / Harvested from The Polish Digital Mathematics Library
Access to full text
Full (PDF)

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 (χ̅)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.

Publié le : 2010-01-01
EUDML-ID : urn:eudml:doc:271061 
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1502,
     author = {Csilla Bujt\'as and E. Sampathkumar and Zsolt Tuza and M.S. Subramanya and Charles Dominic},
     title = {3-consecutive c-colorings of graphs},
     journal = {Discussiones Mathematicae Graph Theory},
     volume = {30},
     year = {2010},
     pages = {393-405},
     zbl = {1217.05087},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1502}
}

Csilla Bujtás; E. Sampathkumar; Zsolt Tuza; M.S. Subramanya; Charles Dominic. 3-consecutive c-colorings of graphs. Discussiones Mathematicae Graph Theory, Tome 30 (2010) pp. 393-405. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1502/

[000] [1] C. Berge, Hypergraphs (North-Holland, 1989).

[001] [2] 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. | Zbl 1210.05088

[002] [3] 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

[003] [4] 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. | Zbl 0777.05085

[004] [5] S. Hedetniemi and R. Laskar, Connected domination in graphs, in: Graph Theory and Combinatorics, B. Bollobás, Ed. (Academic Press, London, 1984) 209-218. | Zbl 0548.05055

[005] [6] J. Lehel and Zs. Tuza, Neighborhood perfect graphs, Discrete Math. 61 (1986) 93-101, doi: 10.1016/0012-365X(86)90031-2.

[006] [7] E. Sampathkumar, DST Project Report, No.SR/S4/MS.275/05.

[007] [8] 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. | Zbl 1231.05102

[008] [9] E. Sampathkumar and P.S. Neralagi, The neighourhood number of a graph, Indian J. Pure Appl. Math. 16 (1985) 126-132.

[009] [10] E. Sampathkumar and H.B. Walikar, The connected domination number of a graph, J. Math. Phys. Sci. 13 (1979) 607-613. | Zbl 0449.05057

[010] [11] 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.

[011] [12] V. Voloshin, The mixed hypergraphs, Computer Sci. J. Moldova 1 (1993) 45-52.