An upper bound for the chromatic number of a graph and its application to timetabling problems
about
Identifying a set of influential spreaders in complex networks.Structure identification in high-resolution transmission electron microscopic images: an example on graphene.Multipolar consensus for phylogenetic trees.Approximation algorithms for combinatorial problemsOn colouring random graphsA branch-and-cut procedure for the Udine Course Timetabling problemA NNIA Scheme for Timetabling ProblemsThe Complexity of Near-Optimal Graph Coloring
P2860
Q37000334-39D6A4C7-47A9-4375-9294-3B905F9F1D77Q51013445-8B32A26B-8171-4D7B-8AB2-5C04E7EC7A9FQ51930403-0C1B3199-B7F4-4707-B484-7AAAAEB6E1DAQ56338199-0d9c8929-4dad-1746-7aa6-d103612ed4afQ56852736-E50E2C87-B2CD-4EB0-8A0F-E45D40740FC9Q57968679-BE1CE2B8-D7B1-4300-9A7D-33B4011399FBQ59146897-F597EC06-160D-4123-B36F-2FF03E3C9E13Q89895272-6a8f7b18-4fcc-5eda-1c6b-65ae5c472c7c
P2860
An upper bound for the chromatic number of a graph and its application to timetabling problems
description
1967 nî lūn-bûn
@nan
1967 թուականի Յունուարին հրատարակուած գիտական յօդուած
@hyw
1967 թվականի հունվարին հրատարակված գիտական հոդված
@hy
1967年の論文
@ja
1967年論文
@yue
1967年論文
@zh-hant
1967年論文
@zh-hk
1967年論文
@zh-mo
1967年論文
@zh-tw
1967年论文
@wuu
name
An upper bound for the chromat ...... cation to timetabling problems
@ast
An upper bound for the chromat ...... cation to timetabling problems
@en
type
label
An upper bound for the chromat ...... cation to timetabling problems
@ast
An upper bound for the chromat ...... cation to timetabling problems
@en
prefLabel
An upper bound for the chromat ...... cation to timetabling problems
@ast
An upper bound for the chromat ...... cation to timetabling problems
@en
P3181
P356
P1433
P1476
An upper bound for the chromat ...... cation to timetabling problems
@en
P2093
M. B. Powell
P2860
P3181
P356
10.1093/COMJNL/10.1.85
P407
P577
1967-01-01T00:00:00Z