An Algorithmic Approach to Equitable Total Chromatic Number of Graphs
DOI:
https://doi.org/10.4067/S0716-09172017000200307Keywords:
Equitable total coloring, Wheel, Helm, Gear, SunletAbstract
References
[1] BONDY, J. A. (1976) Graph Theory with Applications. New York: The Macmillan Press Ltd.
[2] HARARY, FRANK. (1969) Graph Theory. [s.l.]: Narosa Publishing home.
[3] KUN, GONG. (2008) Equitable Total Coloring of Some Join Graphs. EN: Journal of Mathematical Research Exposition, 28(4). [s.l.: s.n.], 823-828.
[4] HUNG-LIN FU. (1994) Some results on equalized total coloring. EN: Congr. Numer. 102. [s.l.: s.n.], 111-119.
[5] GANG, M. A. (2012) The equitable total chromatic number of some join graphs. EN: Open Journal of Applied Sciences. World Congress of Engineering and Technology. [s.l.: s.n.], 96-99.
[6] GANG, M. A. (2012) On the Equitable Total Coloring of Multiple Join-graph. EN: Journal of Mathematical Research and Exposition, 27(2). [s.l.: s.n.], 351-354.
[7] MEYER, W. (1973) Equitable Coloring. EN: Amer. Math. Monthly, 80. [s.l.: s.n.], 920-922.
[8] SANCHEZ - ARROYO, A. (1989) Determining the total coloring number is NPHard. EN: Discrete Math, 78. [s.l.: s.n.], 315-319.
[9] VIZING, V. G. (1964) On an estimate of the chromatic class of a p-graph. EN: Metody Diskret. Analiz., 5. [s.l.: s.n.], 25-30.
[10] WEI-FAN WANG. (2002) Equitable total coloring of graphs with maximum degree 3. EN: Graphs Combin, 18. [s.l.: s.n.], 677-685.
[11] TONG CHUNLING. (2009) Equitable total coloring of Cm2Cn. EN: Discrete Applied Mathematics, 157. [s.l.: s.n.], 596-601.
[2] HARARY, FRANK. (1969) Graph Theory. [s.l.]: Narosa Publishing home.
[3] KUN, GONG. (2008) Equitable Total Coloring of Some Join Graphs. EN: Journal of Mathematical Research Exposition, 28(4). [s.l.: s.n.], 823-828.
[4] HUNG-LIN FU. (1994) Some results on equalized total coloring. EN: Congr. Numer. 102. [s.l.: s.n.], 111-119.
[5] GANG, M. A. (2012) The equitable total chromatic number of some join graphs. EN: Open Journal of Applied Sciences. World Congress of Engineering and Technology. [s.l.: s.n.], 96-99.
[6] GANG, M. A. (2012) On the Equitable Total Coloring of Multiple Join-graph. EN: Journal of Mathematical Research and Exposition, 27(2). [s.l.: s.n.], 351-354.
[7] MEYER, W. (1973) Equitable Coloring. EN: Amer. Math. Monthly, 80. [s.l.: s.n.], 920-922.
[8] SANCHEZ - ARROYO, A. (1989) Determining the total coloring number is NPHard. EN: Discrete Math, 78. [s.l.: s.n.], 315-319.
[9] VIZING, V. G. (1964) On an estimate of the chromatic class of a p-graph. EN: Metody Diskret. Analiz., 5. [s.l.: s.n.], 25-30.
[10] WEI-FAN WANG. (2002) Equitable total coloring of graphs with maximum degree 3. EN: Graphs Combin, 18. [s.l.: s.n.], 677-685.
[11] TONG CHUNLING. (2009) Equitable total coloring of Cm2Cn. EN: Discrete Applied Mathematics, 157. [s.l.: s.n.], 596-601.
Published
2017-06-02
How to Cite
[1]
V. Vivik J. and G. G., “An Algorithmic Approach to Equitable Total Chromatic Number of Graphs”, Proyecciones (Antofagasta, On line), vol. 36, no. 2, pp. 307-324, Jun. 2017.
Issue
Section
Artículos
-
Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.