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

Learn More →

DeepDyve requires Javascript to function. Please enable Javascript on your browser to continue.

A Kaleidoscopic View of Graph Colorings

Part of the SpringerBriefs in Mathematics Book Series

DOI: 10.1007/978-3-319-30518-9

ISBN: 978-3-319-30516-5

Publisher: Springer International Publishing - Springer Journals

Mar 30, 2016

LitStream

Chapter 11Modular Colorings

Zhang, Ping

Pages: 103 –115

[Historically, a number of problems and puzzles have been introduced that initially appeared to have no connection to graph colorings but, upon further analysis, suggested graph coloring problems. In this chapter, we discuss two combinatorial problems and two graph coloring problems inspired by...
LitStream

Chapter 12A Banquet Seating Problem

Zhang, Ping

Pages: 117 –123

[In this chapter, a banquet seating problem is described. The situation encountered in the problem can be naturally modeled by a graph and a vertex coloring of this graph. Such a vertex coloring, in turn, gives rise to other vertex colorings. The initial vertex coloring can be proper or not and,...
LitStream

Chapter 13Irregular Colorings

Zhang, Ping

Pages: 125 –135

[In Chaps. 7–11, nonproper vertex colorings of graphs were described that gave rise to proper vertex colorings that may require fewer colors than the chromatic number of the graphs. In Sect. 12.1, a problem was described whose solution involved producing a vertex-distinguishing coloring of a...
LitStream

Chapter 14Recognizable Colorings

Zhang, Ping

Pages: 137 –149

[In the preceding chapter, irregular colorings of graphs were considered. These are proper vertex colorings c:V(G)→[k]={1,2,…,k}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy}...

results per page

Prev
1
2
Next

Browse All eBooks