DOAJ Open Access 2020

Scheduling Problems and Generalized Graph Coloring

John Machacek

Lihat Sumber DOI

Abstrak

We define a new type of vertex coloring which generalizes vertex coloring in graphs, hypergraphs, andsimplicial complexes. To this coloring there is an associated symmetric function in noncommuting variables for whichwe give a deletion-contraction formula. In the case of graphs our symmetric function in noncommuting variablesagrees with the chromatic symmetric function in noncommuting variables of Gebhard and Sagan. Our vertex coloringis a special case of the scheduling problems defined by Breuer and Klivans. We show how the deletion-contractionlaw can be applied to scheduling problems.

Topik & Kata Kunci

Mathematics

Penulis (1)

John Machacek

Format Sitasi

APA MLA BibTeX

Machacek, J. (2020). Scheduling Problems and Generalized Graph Coloring. https://doi.org/10.46298/dmtcs.6336

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.6336

Informasi Jurnal

Tahun Terbit: 2020
Sumber Database: DOAJ
DOI: 10.46298/dmtcs.6336
Akses: Open Access ✓