Een indelingsprobleem

DOI10.1111/J.1467-9574.1968.TB01360.XzbMath0155.28804OpenAlexW4235509992MaRDI QIDQ5538327

Jac. M. Anthonisse

Publication date: 1968

Published in: Statistica Neerlandica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1467-9574.1968.tb01360.x

zbMATH Keywords

operations research

Cites Work

• An upper bound for the chromatic number of a graph and its application to timetabling problems

This page was built for publication: Een indelingsprobleem