Honors College Theses

Publication Date

12-2-2015

Major

Mathematics (B.S.)

Release Option

Restricted to Georgia Southern

Faculty Mentor

Colton Magnant

Abstract

An edge-colored directed graph is called properly connected if, between every pair of vertices, there is a properly colored directed path. In this work, we study multiple conditions on directed graphs which guarantee the existence of a coloring that is properly connected. We also evaluate conditions on a colored directed graph which guarantee that the coloring is properly connected.

Copyright

This work is archived and distributed under the repository's Standard Copyright and Reuse License (opens in new tab). End users may copy, store, and distribute this work without restriction. For all other uses, permission must be obtained from the copyright owners or their authorized agents.

Download

Share

COinS