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 ColoringsMultiset Colorings

A Kaleidoscopic View of Graph Colorings: Multiset Colorings [In the preceding chapter, a proper vertex coloring of a graph G was discussed that was defined from a given nonproper vertex coloring of G such that the color of a vertex is the set of colors of the neighbors of the vertex. In this chapter, proper vertex colorings are also discussed that arise from nonproper vertex colorings but here they are defined in terms of multisets rather than sets.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

A Kaleidoscopic View of Graph ColoringsMultiset Colorings

Download PDF
8 pages

Loading next page...
 
/lp/springer-journals/a-kaleidoscopic-view-of-graph-colorings-multiset-colorings-A0RRs4EsS1

References (0)

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

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

Abstract

[In the preceding chapter, a proper vertex coloring of a graph G was discussed that was defined from a given nonproper vertex coloring of G such that the color of a vertex is the set of colors of the neighbors of the vertex. In this chapter, proper vertex colorings are also discussed that arise from nonproper vertex colorings but here they are defined in terms of multisets rather than sets.]

Published: Mar 30, 2016

Keywords: Proper Vertex Coloring; Distinct Color Code; Complete Multipartite Graph; Partite Sets; Adjacent Vertices

There are no references for this article.