Scheduling N Burgers for a k-Burger Grill: Chromatic Numbers With Restrictions

DOI10.20429/TAG.2015.020203MaRDI QIDQ5225513zbMATH OpenOpenAlexWikidataFDO

Authors Xiaoya Zha, P. D. jun. Johnson

Publication date 22 July 2019

Published in Theory and Applications of Graphs (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.20429/tag.2015.020203

zbMATH Keywords

fractional chromatic numberindependent setvertex independence number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Chromatic scheduling and frequency assignment
• Chromatic scheduling
• On a multiconstrained model for chromatic scheduling
• Scheduling Problems and Mixed Graph Colorings
• Edge-Chromatic Scheduling with Simultaneity Constraints

This page was built for publication: Scheduling N Burgers for a k-Burger Grill: Chromatic Numbers With Restrictions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5225513)