Entry Colbourn:1982:CCI from compj1980.bib
Last update: Sat Jan 6 02:03:49 MST 2018
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Colbourn:1982:CCI,
author = "Charles J. Colbourn",
title = "Computing the Chromatic Index of {Steiner} Triple
Systems",
journal = j-COMP-J,
volume = "25",
number = "3",
pages = "338--339",
month = aug,
year = "1982",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/25.3.338",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
MRclass = "05B07 (68C15 68E10)",
MRnumber = "84a:05008",
bibdate = "Tue Dec 4 14:48:13 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/25/3.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_03/",
URL = "http://comjnl.oxfordjournals.org/content/25/3/338.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_03/tiff/338.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_03/tiff/339.tif",
acknowledgement = ack-nhfb,
classcodes = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
classification = "723",
corpsource = "Dept. of Computational Sci., Univ. of Saskatchewan,
Saskatoon, Sask., Canada",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "algorithm; branch-and-bound; chromatic index; computer
programming; design of; experiments; graph colouring;
optimal colouring; scheduling; Steiner triple systems",
treatment = "T Theoretical or Mathematical",
}
Related entries
- 68C15,
23(4)290
- 68E10,
23(2)161,
23(3)248,
23(4)332,
24(1)85,
24(2)148
- chromatic,
31(1)76
- colouring,
24(1)85,
27(2)165,
28(1)78,
31(1)76,
32(5)474
- computing,
23(1)85,
23(4)324,
23(4)347,
23(4)353,
24(1)52,
24(1)96,
24(2)162,
24(2)167,
25(1)22,
25(2)188,
25(2)207,
25(2)287,
25(3)397,
26(2)187,
26(2)187,
26(3)224,
26(4)296,
27(1)8,
27(2)97,
27(3)193,
28(2)117,
28(3)243,
28(5)498,
29(2)161,
29(3)229,
29(4)348,
29(4)373,
30(1)20,
30(2)110,
30(3)193,
30(3)258,
30(3)268,
30(3)277,
30(3)282,
30(4)298,
30(5)413,
30(5)420,
30(5)437,
31(1)12,
31(2)175,
31(2)182,
31(3)201,
31(4)364,
31(6)567,
32(3)281,
32(4)362,
32(4)370,
32(5)385,
32(5)437,
32(5)453
- experiment,
23(2)142,
24(2)132,
25(1)105,
26(1)68,
26(2)184,
27(3)238,
31(6)496
- graph,
23(3)237,
24(1)85,
25(3)397,
27(1)86,
27(2)165,
28(1)5,
28(1)44,
28(1)78,
28(2)105,
29(6)531,
29(6)553,
30(1)16,
30(1)20,
30(2)128,
30(6)498,
31(1)71,
31(1)76,
31(2)155,
31(3)253,
31(4)289,
31(4)304,
31(6)545,
32(1)45,
32(2)175,
32(4)290,
32(5)461,
32(5)474
- index,
23(1)37,
24(4)383-1,
25(1)2,
25(2)169,
25(3)327,
28(3)291,
28(4)398,
28(4)406,
28(5)524,
29(5)451,
30(4)343,
30(6)529,
31(1)41
- optimal,
23(4)347,
25(1)32,
25(1)93,
25(2)183,
25(2)239,
27(4)321,
28(1)5,
28(1)17,
28(5)524,
29(1)52,
29(2)161,
29(2)182,
30(4)298,
30(5)433,
31(4)344,
32(3)194,
32(3)246
- scheduling,
25(1)34,
26(1)93,
26(4)320,
27(1)27,
27(1)62,
27(1)72,
30(3)214,
31(2)165,
31(3)201,
31(3)209,
32(1)24