Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2020

Scheduling Problems and Generalized Graph Coloring

Abstract

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.
Fichier principal
Vignette du fichier
final_48.pdf (226) Télécharger le fichier
Loading...

Dates and versions

hal-02168124 , version 1 (28-06-2019)

Identifiers

Cite

John Machacek. Scheduling Problems and Generalized Graph Coloring. 28-th International Conference on Formal Power Series and Algebraic Combinatorics, Simon Fraser University, Jul 2016, Vancouver, Canada. ⟨10.46298/dmtcs.6336⟩. ⟨hal-02168124⟩
65 View
639 Download

Altmetric

Share

More