scientific article
From MaRDI portal
Publication:3781778
zbMath0641.05029MaRDI QIDQ3781778
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable ⋮ On the order of uniquely (k,m)-colourable graphs ⋮ Relaxed chromatic numbers of graphs
This page was built for publication: