Formats
| Format | |
|---|---|
| BibTeX | |
| MARCXML | |
| TextMARC | |
| MARC | |
| DublinCore | |
| EndNote | |
| NLM | |
| RefWorks | |
| RIS |
Details
Title
Chromatic Polynomials Of Some Non-Linear Hypergraphs
Author
Description
In this research, we explore the notion of chromatic polynomial, a function that countsthe number of proper colorings, which are partitions of the vertices of a hypergraphwith some constraint. We introduce the reader to several notions of hypergraphs and classify some acyclic non-linear hypergraphs, which are less studied. Further, using combinatorics and the “deletion-contraction” algorithm we present detailed mathematical proofs along with examples as we derive several chromatic polynomials of both linear and non-linear hypergraphs.
Date
2021-05-10
Department/Academic Units
Department of Mathematics, Computer Science, and Engineering Technology
Author Status
Student
Keywords
Content Type
Text
Resource Type
Journal Articles
Language
English
Dissertation/ Thesis Note
Dissertation
Degree Type
Master's
Usage Statement
CC BY-NC-ND