Geodesic
Scheduling Problems and Generalized Graph Coloring
Discrete mathematics & theoretical computer science, DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016), DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016) (2020).

Voir la notice de l'article provenant de la source Episciences

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. 
@article{DMTCS_2020_special_379_a18,
     author = {Machacek, John},
     title = {Scheduling {Problems} and {Generalized} {Graph} {Coloring}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)},
     year = {2020},
     doi = {10.46298/dmtcs.6336},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.6336/}
}
TY  - JOUR
AU  - Machacek, John
TI  - Scheduling Problems and Generalized Graph Coloring
JO  - Discrete mathematics & theoretical computer science
PY  - 2020
VL  - DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.6336/
DO  - 10.46298/dmtcs.6336
LA  - en
ID  - DMTCS_2020_special_379_a18
ER  - 
%0 Journal Article
%A Machacek, John
%T Scheduling Problems and Generalized Graph Coloring
%J Discrete mathematics & theoretical computer science
%D 2020
%V DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.6336/
%R 10.46298/dmtcs.6336
%G en
%F DMTCS_2020_special_379_a18
Machacek, John. Scheduling Problems and Generalized Graph Coloring. Discrete mathematics & theoretical computer science, DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016), DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016) (2020). doi : 10.46298/dmtcs.6336. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.6336/

Cité par Sources :