Interval edge-coloring: A model of curriculum scheduling
From MaRDI portal
(Redirected from Publication:5012371)
Recommendations
- An application of edge coloring of graphs to a class scheduling problem
- Extensions of coloring models for scheduling purposes
- Edge coloring: a natural model for sports scheduling
- scientific article; zbMATH DE number 2090048
- scientific article; zbMATH DE number 7203465
- Interval colorings of graphs—Coordinated and unstable no‐wait schedules
- scientific article; zbMATH DE number 1594564
Cites work
- Chromatic Numbers for Certain Graphs
- Consecutive colorings of the edges of general graphs
- Consecutive edge-coloring of the generalized -graph
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- Interval edge-colorings of \(K_{1, m, n}\)
- Interval edge-colorings of complete graphs
- Interval edge-colorings of complete graphs and \(n\)-dimensional cubes
- Investigation on interval edge-colorings of graphs
- Sharp bounds of the hyper-Zagreb index on acyclic, unicylic, and bicyclic graphs
Cited in
(5)- Edge finding for cumulative scheduling
- Edge coloring: a natural model for sports scheduling
- ON INTERVAL EDGE-COLORINGS OF COMPLETE MULTIPARTITE GRAPHS
- Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules
- Interval colorings of graphs—Coordinated and unstable no‐wait schedules
This page was built for publication: Interval edge-coloring: A model of curriculum scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5012371)
