Back to search

Georgia Southern University

Conflict Free Connectivity and the Conflict-Free-Connection Number of Graphs

Abstract

dc:description.abstract

We explore a relatively new concept in edge-colored graphs called conflict-free connectivity. A conflict-free path is a (edge-) colored path that has an edge with a color that appears only once. Conflict-free connectivity is the maximal number of internally disjoint conflict-free paths between all pairs of vertices in a graph. We also define the c-conflict-free-connection of a graph G. This is the maximum conflict-free connectivity of G over all c-colorings of the edges of G. In this paper we will briefly survey the works related to conflict-free connectivity. In addition, we will use the probabilistic method to achieve a bound on the c-conflict-free connection number of complete graphs.

Degree

thesis:*
Name thesis:degree_name
Master of Science in Mathematics (M.S.)
Level thesis:degree_level
Thesis (open access)
Discipline thesis:degree_discipline
Department of Mathematical Sciences

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Wehmeier, Travis D
Contributors dc:contributor
  • Colton Magnant
  • Daniel Gray

Subjects

dc:subject × 6

Rights

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.georgiasouthern.edu/etd/1897

Chain of custody

source
Harvested from
Georgia Southern University
Base URL
digitalcommons.georgiasouthern.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Wehmeier, Travis D. Conflict Free Connectivity and the Conflict-Free-Connection Number of Graphs. Thesis (open access) thesis, https://digitalcommons.georgiasouthern.edu/etd/1897