Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

An upper bound for the harmonious chromatic number of a graph.

S. Lee, and J. Mitchem. Journal of Graph Theory, 11 (4): 565-567 (1987)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Arijit Singha Hazari University of Stuttgart

Electrocatalytic proton reduction: Metal based fused diporphyrins with proton relays for efficient catalysisA. Singha Hazari, S. Chandra, Q. Song, D. Hunger, N. Neuman, J. Slageren, E. Klemm, B. Sarkar, and S. Kar. Dataset, (2024)Related to: Chandra, S., Singha Hazari, A., Song, Q., Hunger, D., Neuman, N. I., van Slageren, J., Klemm, E. & Sarkar, B. (2023). Remarkable Enhancement of Catalytic Activity of Cu-Complexes in the Electrochemical Hydrogen Evolution Reaction by Using Triply Fused Porphyrin. ChemSusChem 16, e202201146. doi: 10.1002/cssc.202201146.

Moosung Lee University of Stuttgart

Dongwon Lee University of Stuttgart

Junghwa Lee University of Stuttgart

Ph. D. Benjamin Lee University of Stuttgart

Other publications of authors with the same name

A note on edge-graceful spectra of the square of paths.T. Wang, C. Hsiao, and S. Lee. Discrete Mathematics, 308 (23): 5878-5885 (2008)On felicitous graphs.S. Lee, E. Schmeichel, and S. Shee. Discrete Mathematics, 93 (2-3): 201-209 (1991)On k-edge-magic labelings of maximal outerplanar graphs.G. Lau, S. Alikhani, S. Lee, and W. Kocay. AKCE Int. J. Graphs Comb., 12 (1): 40-46 (2015)On the k-edge magic graphs.S. Alikhani, W. Kocay, G. Lau, and S. Lee. Electron. Notes Discret. Math., (2014)An upper bound for the harmonious chromatic number of a graph.S. Lee, and J. Mitchem. Journal of Graph Theory, 11 (4): 565-567 (1987)On Magic Strength of Graph.M. Kong, S. Lee, and H. Sun. Ars Comb., (1997)On the number of unlabeled vertices in edge-friendly labelings of graphs.E. Krop, S. Lee, and C. Raridan. Discrete Mathematics, 312 (3): 574-577 (2012)On full friendly index sets of 1-level and 2-levels N-grids.Z. Gao, G. Sun, and S. Lee. Discrete Applied Mathematics, (2016)On friendly index sets of k-galaxies.S. Lee, R. Low, H. Ng, and Y. Wang. EJGTA, 7 (1): 1-10 (2019)Edge-magic Indices of (n, n - 1)-graphs.W. Shiu, P. Lam, and S. Lee. Electron. Notes Discret. Math., (2002)