Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Kaleidoscopic View of Graph ColoringsHarmonious Vertex Colorings

A Kaleidoscopic View of Graph Colorings: Harmonious Vertex Colorings [In this chapter, we study vertex colorings of graphs, where the colors are elements of ℤk\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$\mathbb{Z}_{k}$$ \end{document} or of [k] for some integer k ≥ 2. These give rise to either edge-distinguishing labelings or proper edge colorings defined in a variety of ways.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

A Kaleidoscopic View of Graph ColoringsHarmonious Vertex Colorings

Download PDF
8 pages

Loading next page...
 
/lp/springer-journals/a-kaleidoscopic-view-of-graph-colorings-harmonious-vertex-colorings-pJ1B3FpExT

References (8)

Publisher
Springer International Publishing
Copyright
© The Author 2016
ISBN
978-3-319-30516-5
Pages
53 –61
DOI
10.1007/978-3-319-30518-9_5
Publisher site
See Chapter on Publisher Site

Abstract

[In this chapter, we study vertex colorings of graphs, where the colors are elements of ℤk\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$\mathbb{Z}_{k}$$ \end{document} or of [k] for some integer k ≥ 2. These give rise to either edge-distinguishing labelings or proper edge colorings defined in a variety of ways.]

Published: Mar 30, 2016

Keywords: Chromatic Number; Adjacent Vertex; Distinct Color; Edge Label; Vertex Label

There are no references for this article.