Some uses of hypergraphs in timetabling

MaRDI QIDQ3402439zbMATH OpenFDO

Authors Dominique De Werra

Publication date 4 February 2010

Mathematics Subject Classification ID

Hypergraphs (05C65) Applications of graph theory (05C90) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 3910116
• Restricted coloring models for timetabling
• scientific article; zbMATH DE number 913024
• The combinatorics of timetabling
• scientific article; zbMATH DE number 3867045

Cited in

(8)

• Mutual exclusion scheduling with interval graphs or related classes. I
• Restricted coloring models for timetabling
• Mutual exclusion scheduling with interval graphs or related classes. II
• scientific article; zbMATH DE number 3874960 (Why is no real title available?)
• scientific article; zbMATH DE number 3910116 (Why is no real title available?)
• Template-driven rainbow coloring of proper interval graphs
• Template-driven rainbow coloring of proper interval graphs
• Bounded vertex colorings of graphs

This page was built for publication: Some uses of hypergraphs in timetabling

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