An upper bound for the chromatic number of a graph and its application to timetabling problems
(Q29302438)
scientific article (publication date: 1967)
scientific article (publication date: 1967)
Language:
Current Data About
An upper bound for the chromatic number of a graph and its application to timetabling problems
| (P31) |
(Q13442814)
|
||||||
| (P50) |
(Q1237660)
|
||||||
| (P304) |
85-86
|
||||||
| (P407) |
(Q1860)
|
||||||
| (P433) |
1
|
||||||
| (P478) |
10
|
||||||
| (P577) |
Sunday, January 1, 1967
|
||||||
| (P1433) |
(Q7727237)
|
||||||
| (P1476) |
"An upper bound for the chromatic number of a graph and its application to timetabling problems" (language: en)
|
||||||
| (P2093) |
M. B. Powell
|
||||||
| (P2860) |
(Q55953420)
(Q56551454) |
||||||
| (P6104) |
(Q8487137)
|
other details
| description | scientific article (publication date: 1967) |
External Links
| (P356) |
10.1093/COMJNL/10.1.85
|
| (P894) |
0147.15206
|
| (P3181) |
792369
|
| (P8978) |
journals/cj/WelshP67
|