Discrete Mathematics and Combinatorics Commons^™

The Linear Cutwidth And Cyclic Cutwidth Of Complete N-Partite Graphs, Stephanie A. Creswell

Electronic Theses, Projects, and Dissertations

The cutwidth of different graphs is a topic that has been extensively studied. The basis of this paper is the cutwidth of complete n-partite graphs. While looking at the cutwidth of complete n-partite graphs, we strictly consider the linear embedding and cyclic embedding. The relationship between the linear cutwidth and the cyclic cutwidth is discussed and used throughout multiple proofs of different cases for the cyclic cutwidth. All the known cases for the linear and cyclic cutwidth of complete bipartite, complete tripartite, and complete n-partite graphs are highlighted.

The main focus of this paper is to expand …