## Electronic Theses and Dissertations

## Identifier

32

## Date

2010

## Document Type

Dissertation

## Degree Name

Doctor of Philosophy

## Major

Mathematical Sciences

## Concentration

Mathematics

## Committee Chair

Jeno Lehel

## Committee Member

Paul Balister

## Committee Member

Bela Bollobas

## Committee Member

James T Campbell

## Abstract

A graph is a collection of vertices and edges, often represented by points and connecting lines in the plane. A proper coloring of the graph assigns colors to the vertices, edges, or both so that proximal elements are assigned distinct colors. Here we examine results from three different coloring problems. First, adjacent vertex distinguishing total colorings are proper total colorings such that the set of colors appearing at each vertex is distinct for every pair of adjacent vertices. Next, vertex coloring total weightings are an assignment of weights to the vertices and edges of a graph so that every pair of adjacent vertices have distinct weight sums. Finally, edge list multi-colorings consider assignments of color lists and demands to edges; edges are colored with a subset of their color list of size equal to its color demand so that adjacent edges have disjoint sets. Here, color sets consisting of measurable sets are considered.

## Library Comment

Dissertation or thesis originally submitted to the local University of Memphis Electronic Theses & dissertation (ETD) Repository.

## Recommended Citation

Hulgan, Jonathan Darren, "Graph Colorings with Constraints" (2010). *Electronic Theses and Dissertations*. 21.

https://digitalcommons.memphis.edu/etd/21

## Comments

Data is provided by the student.